Two-dimensional packing problems: a survey
From MaRDI portal
Recommendations
- Two-dimensional bin packing problems
- Exact solution techniques for two-dimensional cutting and packing
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- An exact algorithm for the two-dimensional strip-packing problem
- Recent advances on two-dimensional bin packing problems
Cites work
- A 2.5 times optimal algorithm for packing in two dimensions
- A algorithm for two-dimensional packing
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A near-optimal solution to a two-dimensional cutting stock problem
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- An analytical model for the container loading problem
- An approximation scheme for strip packing of rectangles with bounded dimensions
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact approach to the strip-packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved BL lower bound
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Average-case analysis of cutting and packing in two dimensions
- Bin packing can be solved within 1+epsilon in linear time
- Exact solution of the two-dimensional finite bin packing problem
- Guided local search and its application to the traveling salesman problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- scientific article; zbMATH DE number 4062626 (Why is no real title available?)
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 176070 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Models and bounds for two-dimensional level packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- On genetic algorithms for the packing of polygons
- On Packing Two-Dimensional Bins
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Orthogonal Packings in Two Dimensions
- Packing problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Some experiments with simulated annealing techniques for packing problems
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- The Three-Dimensional Bin Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
Cited in
(only showing first 100 items - show all)- An agent-based approach to the two-dimensional guillotine bin packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- Bidimensional packing by bilinear programming
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- New exact approaches and approximation results for the penalized knapsack problem
- Provider selection and task allocation in telecommunications with QoS degradation policy
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Scheduling under the network of temporo-spatial proximity relationships
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Combined cutting stock and lot-sizing problem with pattern setup
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Redundant cumulative constraints to compute preemptive bounds
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- Co-scheduling algorithms for high-throughput workload execution
- Offline first-fit decreasing height scheduling of power loads
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- The complexity landscape of decompositional parameters for ILP
- Mixed-integer linear programming heuristics for the prepack optimization problem
- Layout optimisation for an installation port of an offshore wind farm
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- The load planning problem for double-stack intermodal trains
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Models and bounds for two-dimensional level packing problems
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- Two-dimensional knapsack-block packing problem
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- The pallet loading problem: three-dimensional bin packing with practical constraints
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- Exact solution techniques for two-dimensional cutting and packing
- Queue-constrained packing: a vehicle ferry case study
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Techniques and results on approximation algorithms for packing circles
- 2DPackLib: a two-dimensional cutting and packing library
- Asynchronous optimization of part logistics routing problem
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
- Fragmentary structures in a two-dimensional strip packing problem
- A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
- A survey on the cutting and packing problems
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Irreducible bin packing and normality in routing open shop
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
- Exact and heuristic methods for placing ships in locks
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Heuristics for packing semifluids
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A branch-and-price algorithm for the temporal bin packing problem
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Integrated shipment dispatching and packing problems: a case study
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- A two-dimensional vector packing model for the efficient use of coil cassettes
- Exhaustive approaches to 2D rectangular perfect packings
- Approximation and online algorithms for multidimensional bin packing: a survey
- The bin packing problem with item fragmentation: a worst-case analysis
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- An enumeration scheme to generate constrained exact checkerboard patterns
- An optimization algorithm for a penalized knapsack problem
- Two-dimensional bin packing with one-dimensional resource augmentation
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- A 3-approximation algorithm for two-dimensional bin packing
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Sequential heuristic for the two-dimensional bin-packing problem
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- A dynamic adaptive local search algorithm for the circular packing problem
- An integrated cutting stock and sequencing problem
- A two-dimensional strip cutting problem with sequencing constraint
- Optimising the cutting of wood fibre plates in the hardboard industry
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
This page was built for publication: Two-dimensional packing problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847188)
