On the public citation graph

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

https://doi.org/10.1137/0209062
0 signed · 451 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0020-0190(80)90121-0openalex-snapshot
A 2.5 times optimal algorithm for packing in two dimensions
inferredcites →https://doi.org/10.1016/0097-3165(76)90001-7openalex-snapshot
Resource constrained scheduling as generalized bin packing
inferredcites →https://doi.org/10.1137/0203025openalex-snapshot
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
inferredcites →https://doi.org/10.1137/0209064openalex-snapshot
Orthogonal Packings in Two Dimensions
inferredcites →https://doi.org/10.1287/opre.26.1.3openalex-snapshot
Performance Guarantees for Scheduling Algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.1120998openalex-extracted
Kiln Planning, A Cutting Stock Approach
inferred← citeshttps://doi.org/10.5281/zenodo.1289611openalex-extracted
Non-Overlapping, Time-Coherent Visualisation Of Action Commands In The Ascograph Interactive Music User Interface
inferred← citeshttps://doi.org/10.1002/9781118600207.ch5openalex-snapshot
Two‐Dimensional Bin Packing Problems
inferred← citeshttps://doi.org/10.1002/9781119005353.biblioopenalex-snapshot
General Bibliography
inferred← citeshttps://doi.org/10.1002/9781119005353.ch5openalex-snapshot
Two‐Dimensional Bin Packing Problems
inferred← citeshttps://doi.org/10.1002/jos.74openalex-snapshot
Scheduling space-sharing for internet advertising
inferred← citeshttps://doi.org/10.1006/jagm.1997.0876openalex-snapshot
On Two Dimensional Packing
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_20openalex-snapshot
On Weighted Rectangle Packing with Large Resources
inferred← citeshttps://doi.org/10.1007/10968987_12openalex-snapshot
Backfilling with Lookahead to Optimize the Performance of Parallel Job Scheduling
inferred← citeshttps://doi.org/10.1007/11602613_103openalex-snapshot
On Efficient Weighted Rectangle Packing with Large Resources
inferred← citeshttps://doi.org/10.1007/11605300_8openalex-snapshot
Scheduling Moldable BSP Tasks
inferred← citeshttps://doi.org/10.1007/11671541_6openalex-snapshot
Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
inferred← citeshttps://doi.org/10.1007/11686699_17openalex-snapshot
Quality Assignments for WSDL-Based Services
inferred← citeshttps://doi.org/10.1007/11786986_22openalex-snapshot
Approximating the Orthogonal Knapsack Problem for Hypercubes
inferred← citeshttps://doi.org/10.1007/11802167_74openalex-snapshot
Scheduling of Transactions Based on Extended Scheduling Timed Petri Nets for SoC System-Level Test-Case Generation
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_14openalex-snapshot
Bin-packing in 1.5 dimension
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_50openalex-snapshot
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_30openalex-snapshot
Disconnected Graph Layout and the Polyomino Packing Approach
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_23openalex-snapshot
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_24openalex-snapshot
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_35openalex-snapshot
Enumerative vs. genetic optimization two parallel algorithms for the bin packing problem
inferred← citeshttps://doi.org/10.1007/3-540-60153-8_30openalex-snapshot
A microeconomic scheduler for parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_142openalex-snapshot
On two dimensional packing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0233-9_7openalex-snapshot
Metaheuristic Algorithms for the Strip Packing Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_9openalex-snapshot
Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-4137-7_24openalex-snapshot
Heuristics for Large Strip Packing Problems with Guillotine Patterns: An Empirical Study
inferred← citeshttps://doi.org/10.1007/978-1-4757-6527-4_3openalex-snapshot
On Concurrent Test of Core-Based SOC Design
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_36openalex-snapshot
Cutting Stock with Rotation: Packing Square Items into Square Bins
inferred← citeshttps://doi.org/10.1007/978-3-030-86433-0_20openalex-snapshot
Fast Heuristic Algorithms for the Multiple Strip Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-92711-0_14openalex-snapshot
A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_16openalex-snapshot
High Multiplicity Strip Packing with Three Rectangle Types
inferred← citeshttps://doi.org/10.1007/978-3-031-20500-2_6openalex-snapshot
A Large-Scale Tobacco 3D Bin Packing Model Based on Dual-Task Learning of Group Blocks
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_29openalex-snapshot
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_31openalex-snapshot
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-28697-6_10openalex-snapshot
Upper Bounds for Heuristic Approaches to the Strip Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-42902-1_8openalex-snapshot
Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_32openalex-snapshot
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width
inferred← citeshttps://doi.org/10.1007/978-3-319-64403-5_7openalex-snapshot
Packing Rectangles into a Strip
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_15openalex-snapshot
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_40openalex-snapshot
Packing Problems with Orthogonal Rotations
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_6openalex-snapshot
This Side Up!
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_13openalex-snapshot
A Polynomial Time Approximation Scheme for the Square Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3openalex-snapshot
Algorithm theory -- SWAT 2008 : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_28openalex-snapshot
Packing Rectangles into 2OPT Bins Using Rotations
inferred← citeshttps://doi.org/10.1007/978-3-540-69995-8_87openalex-snapshot
Approaches to Solving RCPSP Using Relaxed Problem with Consumable Resources
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_20openalex-snapshot
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_34openalex-snapshot
Strip Packing vs. Bin Packing
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_11openalex-snapshot
New Approximability Results for 2-Dimensional Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78295-7_7openalex-snapshot
Hybrid Metaheuristics for Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-79438-7_3openalex-snapshot
An Efficient Hyperheuristic for Strip-Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_10openalex-snapshot
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_4openalex-snapshot
Approximation Algorithms for Multiple Strip Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_26openalex-snapshot
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_23openalex-snapshot
Approximating the Non-contiguous Multiple Organization Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-16955-7_1openalex-snapshot
FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_40openalex-snapshot
A (5/3 + ε)-Approximation for Strip Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_25openalex-snapshot
Scheduling Jobs on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1007/978-3-642-25566-3_6openalex-snapshot
Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_1openalex-snapshot
Approximation Algorithms for Scheduling and Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_13openalex-snapshot
On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_25openalex-snapshot
Coordination Mechanisms for Selfish Parallel Jobs Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_3openalex-snapshot
Smart-Grid Electricity Allocation via Strip Packing with Slicing
inferred← citeshttps://doi.org/10.1007/978-3-642-45065-5_6openalex-snapshot
FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_111openalex-snapshot
About the Gap Between the Optimal Values of the Integer and Continuous Relaxation One-Dimensional Cutting Stock Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_8openalex-snapshot
On the Level-Oriented Two-Dimensional Packing With Rotation of the Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-642-78123-0_18openalex-snapshot
Ein massiv paralleler, genetischer Algorithmus zur Lösung eines Bin-Packing-Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-79459-9_18openalex-snapshot
Cutting Stock by Iterated Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-84356-3_11openalex-snapshot
A Three Dimensional Dynamic Palletizing Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-7091-2748-3_8openalex-snapshot
Approximation Algorithms for Bin Packing Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-7091-4338-4_3openalex-snapshot
Approximation Algorithms for Bin-Packing — An Updated Survey
inferred← citeshttps://doi.org/10.1007/978-94-011-5678-3_20openalex-snapshot
Bounds for Approximate Solution of a Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-981-19-8922-3_6openalex-snapshot
Mixed-Criticality Scheduling on 5G New Radio
inferred← citeshttps://doi.org/10.1007/bf00264439openalex-snapshot
Lower bounds for on-line two-dimensional packing algorithms
inferred← citeshttps://doi.org/10.1007/bf01068866openalex-snapshot
Number of rectangles of unit width sufficient for packing given rectangles
inferred← citeshttps://doi.org/10.1007/bf01190899openalex-snapshot
Packings in two dimensions: Asymptotic average-case analysis of algorithms
inferred← citeshttps://doi.org/10.1007/bf01261655openalex-snapshot
Greed in resource scheduling
inferred← citeshttps://doi.org/10.1007/bf01416240openalex-snapshot
A comparison of heuristic algorithms for cost-oriented assembly line balancing
inferred← citeshttps://doi.org/10.1007/bf01719252openalex-snapshot
Efficient heuristics for robot acquisition planning for a CIM system
inferred← citeshttps://doi.org/10.1007/bf02085642openalex-snapshot
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
inferred← citeshttps://doi.org/10.1007/bf02099695openalex-snapshot
The nesting problem in the leather manufacturing industry
inferred← citeshttps://doi.org/10.1007/bf02309555openalex-snapshot
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
inferred← citeshttps://doi.org/10.1007/bfb0006186openalex-snapshot
Extensions of some two-dimensional bin packing algorithms
inferred← citeshttps://doi.org/10.1007/bfb0022288openalex-snapshot
Architecture-independent request-scheduling with tight waiting-time estimations
inferred← citeshttps://doi.org/10.1007/bfb0049416openalex-snapshot
Reverse-Fit: A 2-optimal algorithm for packing rectangles
inferred← citeshttps://doi.org/10.1007/s00224-019-09910-6openalex-snapshot
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
inferred← citeshttps://doi.org/10.1007/s00224-025-10217-yopenalex-snapshot
High Multiplicity Strip Packing with Three Rectangle Types
inferred← citeshttps://doi.org/10.1007/s00236-002-0089-0openalex-snapshot
Packing rectangles in a strip
inferred← citeshttps://doi.org/10.1007/s00453-003-1078-6openalex-snapshot
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme
inferred← citeshttps://doi.org/10.1007/s00453-012-9713-8openalex-snapshot
Online Square Packing with Gravity
inferred← citeshttps://doi.org/10.1007/s00453-014-9943-zopenalex-snapshot
New Approximability Results for Two-Dimensional Bin Packing
inferred← citeshttps://doi.org/10.1007/s00453-015-0052-4openalex-snapshot
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
inferred← citeshttps://doi.org/10.1007/s00453-023-01116-0openalex-snapshot
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
inferred← citeshttps://doi.org/10.1007/s00453-023-01130-2openalex-snapshot
A Tight $$(3/2+\varepsilon )$$-Approximation for Skewed Strip Packing
inferred← citeshttps://doi.org/10.1007/s00453-023-01152-wopenalex-snapshot
Peak Demand Minimization via Sliced Strip Packing
inferred← citeshttps://doi.org/10.1007/s00778-012-0279-5openalex-snapshot
On the optimization of schedules for MapReduce workloads in the presence of shared scans
inferred← citeshttps://doi.org/10.1007/s10107-004-0548-1openalex-snapshot
The two-dimensional cutting stock problem revisited
inferred← citeshttps://doi.org/10.1007/s10288-005-0052-3openalex-snapshot
Metaheuristic algorithms for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s10479-009-0642-0openalex-snapshot
Bidirectional best-fit heuristic for orthogonal rectangular strip packing
inferred← citeshttps://doi.org/10.1007/s10479-014-1572-zopenalex-snapshot
Relations between capacity utilization, minimal bin size and bin number
inferred← citeshttps://doi.org/10.1007/s10479-025-06633-5openalex-snapshot
Covering a square with consecutive squares
inferred← citeshttps://doi.org/10.1007/s10586-015-0460-xopenalex-snapshot
Agent-based load balancing in Cloud data centers
inferred← citeshttps://doi.org/10.1007/s10732-012-9203-9openalex-snapshot
A heuristic algorithm for the strip packing problem
inferred← citeshttps://doi.org/10.1007/s10836-011-5233-8openalex-snapshot
Optimization Methods for Post-Bond Testing of 3D Stacked ICs
inferred← citeshttps://doi.org/10.1007/s10878-005-5481-6openalex-snapshot
Average-Case Performance Analysis of a 2D Strip Packing Algorithm?NFDH
inferred← citeshttps://doi.org/10.1007/s10878-007-9125-xopenalex-snapshot
A note on online strip packing
inferred← citeshttps://doi.org/10.1007/s10878-016-0046-4openalex-snapshot
A new upper bound for the online square packing problem in a strip
inferred← citeshttps://doi.org/10.1007/s10878-016-0088-7openalex-snapshot
Triple-solution approach for the strip packing problem with two-staged patterns
inferred← citeshttps://doi.org/10.1007/s10878-024-01201-2openalex-snapshot
Models for two-dimensional bin packing problems with customer order spread
inferred← citeshttps://doi.org/10.1007/s10898-017-0524-yopenalex-snapshot
iGreen: green scheduling for peak demand minimization
inferred← citeshttps://doi.org/10.1007/s10898-021-01078-zopenalex-snapshot
Asynchronous optimization of part logistics routing problem
inferred← citeshttps://doi.org/10.1007/s10951-006-8497-6openalex-snapshot
Scheduling parallel jobs to minimize the makespan
inferred← citeshttps://doi.org/10.1007/s10951-007-0032-xopenalex-snapshot
On-line scheduling of parallel jobs in a list
inferred← citeshttps://doi.org/10.1007/s10951-009-0110-3openalex-snapshot
Absolute approximation ratios for packing rectangles into bins
inferred← citeshttps://doi.org/10.1007/s10951-014-0406-9openalex-snapshot
Improved upper bounds for online malleable job scheduling
inferred← citeshttps://doi.org/10.1007/s10951-015-0427-zopenalex-snapshot
On contiguous and non-contiguous parallel task scheduling
inferred← citeshttps://doi.org/10.1007/s10951-015-0445-xopenalex-snapshot
Co-scheduling algorithms for high-throughput workload execution
inferred← citeshttps://doi.org/10.1007/s10951-017-0528-yopenalex-snapshot
Offline first-fit decreasing height scheduling of power loads
inferred← citeshttps://doi.org/10.1007/s10951-018-0576-yopenalex-snapshot
Malleable scheduling for flows of jobs and applications to MapReduce
inferred← citeshttps://doi.org/10.1007/s10958-022-06151-wopenalex-snapshot
An Improved Approximation for Packing Big Two-Bar Charts
inferred← citeshttps://doi.org/10.1007/s11265-006-8537-7openalex-snapshot
Resource Sharing Combined with Layout Effects in High-Level Synthesis
inferred← citeshttps://doi.org/10.1007/s11590-020-01657-1openalex-snapshot
Two-Bar Charts Packing Problem
inferred← citeshttps://doi.org/10.1007/s11590-022-01858-wopenalex-snapshot
Guillotine cutting is asymptotically optimal for packing consecutive squares
inferred← citeshttps://doi.org/10.1007/s11814-012-0125-xopenalex-snapshot
Developing a heuristics for glass cutting process optimization: A case of two-dimensional two-stage guillotine cutting with multiple stock sizes
inferred← citeshttps://doi.org/10.1007/s12667-021-00453-9openalex-snapshot
Offline preemptive bottom left decreasing height scheduling of power loads in smart grids
inferred← citeshttps://doi.org/10.1007/s40031-012-0028-6openalex-snapshot
Performance Analysis of Selective Breeding Algorithm on One Dimensional Bin Packing Problems
inferred← citeshttps://doi.org/10.1007/s40863-022-00301-3openalex-snapshot
Techniques and results on approximation algorithms for packing circles
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90031-9openalex-snapshot
An improved BL lower bound
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90121-0openalex-snapshot
A 2.5 times optimal algorithm for packing in two dimensions
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00044-dopenalex-snapshot
Probabilistic analysis of k-dimensional packing algorithms
inferred← citeshttps://doi.org/10.1016/0165-6074(94)90092-2openalex-snapshot
Optimal scheduling of independent jobs in multiprocessor systems
inferred← citeshttps://doi.org/10.1016/0167-188x(87)90064-4openalex-snapshot
An analysis of heuristic trim-loss algorithms
inferred← citeshttps://doi.org/10.1016/0167-739x(95)00017-mopenalex-snapshot
Building a virtual machine-room — a focal point in metacomputing
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90034-1openalex-snapshot
A algorithm for two-dimensional packing
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90028-1openalex-snapshot
A two-dimensional bin-packing model of preemptive, FIFO storage allocation
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90058-kopenalex-snapshot
Heuristic algorithms for on-line packing in three dimensions
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90075-4openalex-snapshot
Network flows and non-guillotine cutting patterns
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90349-gopenalex-snapshot
Average-case analysis of cutting and packing in two dimensions
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90249-9openalex-snapshot
Oriented aligned rectangle packing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90196-topenalex-snapshot
An algorithm for the 2D guillotine cutting stock problem
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00029-popenalex-snapshot
Guillotineable bin packing: A genetic approach
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90024-jopenalex-snapshot
Static job scheduling in partitionable mesh connected systems
inferred← citeshttps://doi.org/10.1016/0885-064x(87)90009-4openalex-snapshot
Bin packing with divisible item sizes
inferred← citeshttps://doi.org/10.1016/b978-0-444-89597-4.50008-1openalex-snapshot
Finite Packing and Covering
inferred← citeshttps://doi.org/10.1016/j.aej.2014.06.009openalex-snapshot
3D overlapped grouping Ga for optimum 2D guillotine cutting stock problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.06.063openalex-snapshot
Robust hyper-heuristic algorithms for the offline oriented/non-oriented 2D bin packing problems
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106268openalex-snapshot
Improved metaheuristics for the two-dimensional strip packing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2016.10.011openalex-snapshot
A novel heuristic algorithm for two-dimensional rectangle packing area minimization problem with central rectangle
inferred← citeshttps://doi.org/10.1016/j.cie.2017.06.019openalex-snapshot
Biased randomization of heuristics using skewed probability distributions: A survey and some applications
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109096openalex-snapshot
Generalized multiple strip packing problem: Formulations, applications, and solution algorithms
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111450openalex-snapshot
A computational intelligence method to solve the problem of packing variable-length fresh products into fixed-size bins
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.008openalex-snapshot
A (5/3+ε) -approximation for strip packing
inferred← citeshttps://doi.org/10.1016/j.cor.2005.10.001openalex-snapshot
Two- and three-dimensional parametric packing
inferred← citeshttps://doi.org/10.1016/j.cor.2008.03.004openalex-snapshot
A least wasted first heuristic algorithm for the rectangular packing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.015openalex-snapshot
Three-dimensional packings with rotations
inferred← citeshttps://doi.org/10.1016/j.cor.2009.05.008openalex-snapshot
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
inferred← citeshttps://doi.org/10.1016/j.cor.2010.12.018openalex-snapshot
Exact algorithms for the two-dimensional guillotine knapsack
inferred← citeshttps://doi.org/10.1016/j.cor.2012.11.003openalex-snapshot
Heuristics for the strip packing problem with unloading constraints
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106044openalex-snapshot
Strip based compact formulation for two-dimensional guillotine cutting problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2016.12.001openalex-snapshot
Approximation and online algorithms for multidimensional bin packing: A survey
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.09.001openalex-snapshot
Two-dimensional bin packing with one-dimensional resource augmentation
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.11.002openalex-snapshot
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.04.001openalex-snapshot
Rectangle packing with one-dimensional resource augmentation
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.03.003openalex-snapshot
An approximation scheme for the two-stage, two-dimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.11.004openalex-snapshot
New upper bounds for online strip packing
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.08.007openalex-snapshot
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.07.024openalex-snapshot
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.03.049openalex-snapshot
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.04.020openalex-snapshot
A block-based layer building approach for the 2D guillotine strip packing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.10.012openalex-snapshot
A new lower bound for online strip packing
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.10.002openalex-snapshot
Heuristics for packing semifluids
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.11.031openalex-snapshot
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.08.034openalex-snapshot
An improved approximation algorithm for scheduling monotonic moldable tasks
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.014openalex-snapshot
Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.046openalex-snapshot
Two Dimensional Knapsack with Unloading Constraints
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.063openalex-snapshot
Selfish Square Packing
inferred← citeshttps://doi.org/10.1016/j.engappai.2004.02.003openalex-snapshot
Strip-packing using hybrid genetic approach
inferred← citeshttps://doi.org/10.1016/j.engappai.2008.10.025openalex-snapshot
A revision of recent approaches for two-dimensional strip-packing problems
inferred← citeshttps://doi.org/10.1016/j.engappai.2017.06.023openalex-snapshot
Fast algorithms for online construction of web tag clouds
inferred← citeshttps://doi.org/10.1016/j.engappai.2017.08.012openalex-snapshot
An improved heuristic algorithm for 2D rectangle packing area minimization problems with central rectangles
inferred← citeshttps://doi.org/10.1016/j.engappai.2021.104291openalex-snapshot
NHACR: A novel heuristic approach for 2D rectangle packing area minimization problem with central rectangle
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.04.105openalex-snapshot
A fast layer-based heuristic for non-guillotine strip packing
inferred← citeshttps://doi.org/10.1016/j.exmath.2013.12.002openalex-snapshot
Packing, covering and tiling in two-dimensional spaces
inferred← citeshttps://doi.org/10.1016/j.ic.2016.03.010openalex-snapshot
Approximate strip packing: Revisited
inferred← citeshttps://doi.org/10.1016/j.ijpe.2013.04.032openalex-snapshot
Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.10.003openalex-snapshot
A note on the Kenyon–Remila strip-packing algorithm
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.08.008openalex-snapshot
A priority heuristic for the guillotine rectangular packing problem
inferred← citeshttps://doi.org/10.1016/j.jda.2010.07.002openalex-snapshot
Dynamic multi-dimensional bin packing
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.01.011openalex-snapshot
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.12.003openalex-snapshot
List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.111990openalex-snapshot
A Dynamic Multi-modal deep Reinforcement Learning framework for 3D Bin Packing Problem
inferred← citeshttps://doi.org/10.1016/j.neucom.2024.128609openalex-snapshot
Task scheduling for control system based on deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.orl.2005.02.005openalex-snapshot
Resource augmentation in two-dimensional packing with orthogonal rotations
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.255openalex-snapshot
Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.024openalex-snapshot
Strip packing with precedence constraints and strip packing with release times
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.025openalex-snapshot
Approximate composable truthful mechanism design
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.002openalex-snapshot
Improved approximation for two dimensional Strip Packing with polynomial bounded width
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90817-7openalex-snapshot
Two-dimensional packing: expected performance of simple level algorithms
inferred← citeshttps://doi.org/10.1016/s0020-0255(02)00183-4openalex-snapshot
Two-dimensional packing algorithms for layout of disconnected graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00347-xopenalex-snapshot
Recent advances on two-dimensional bin packing problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00130-3openalex-snapshot
An approximation scheme for strip packing of rectangles with bounded dimensions
showing the first 200 of 446
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.