Two-dimensional packing problems: a survey

DOI10.1016/S0377-2217(02)00123-6MaRDI QIDQ1847188zbMATH OpenDBLPWikidataFDO

Authors Andrea Lodi, Michele Monaci, Silvano Martello

Publication date 17 November 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Bin packing problemsStrip packing problemsTwo-dimensional packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80)

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

• 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?)
• A 2.5 times optimal algorithm for packing in two dimensions
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• A algorithm for two-dimensional packing
• A near-optimal solution to a two-dimensional cutting stock problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• 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 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
• 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 Packing Two-Dimensional Bins
• On genetic algorithms for the packing of polygons
• 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)

• New exact approaches and approximation results for the penalized knapsack problem
• A survey on the cutting and packing problems
• Provider selection and task allocation in telecommunications with QoS degradation policy
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• Grids for cutting and packing problems: a study in the 2D knapsack problem
• Asynchronous optimization of part logistics routing problem
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• Number of bins and maximum lateness minimization in two-dimensional bin packing
• An effective approximation algorithm for the malleable parallel task scheduling problem
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• The load planning problem for double-stack intermodal trains
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• New lower bound and exact method for the continuous berth allocation problem
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
• Exact solution techniques for two-dimensional cutting and packing
• Integrated shipment dispatching and packing problems: a case study
• Optimizing yard assignment in an automotive transshipment terminal
• A branch-and-price algorithm for the two-dimensional level strip packing problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search
• Scheduling under the network of temporo-spatial proximity relationships
• Space and time allocation in a shipyard assembly hall
• On the complexity of adjacent resource scheduling
• The pallet loading problem: three-dimensional bin packing with practical constraints
• A new heuristic algorithm for the circular packing problem with equilibrium constraints
• The layout problem of two kinds of graph elements with performance constraints and its optimality conditions
• An enumeration scheme to generate constrained exact checkerboard patterns
• Corner occupying theorem for the two-dimensional integral rectangle packing problem
• Combined cutting stock and lot-sizing problem with pattern setup
• The constrained compartmentalised knapsack problem
• Linear models for 1-group two-dimensional guillotine cutting problems
• An optimization algorithm for a penalized knapsack problem
• Layout optimisation for an installation port of an offshore wind farm
• The cutting stock problem in small and medium size furniture industries
• Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
• Fragmentary structures in a two-dimensional strip packing problem
• Modeling two-dimensional guillotine cutting problems via integer programming
• Relations between capacity utilization, minimal bin size and bin number
• A computational study of lower bounds for the two dimensional bin packing problem
• Numerical optimization method for packing regular convex polygons
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
• Parameterized complexity of strip packing and minimum volume packing
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• Sequential heuristic for the two-dimensional bin-packing problem
• Logic based Benders' decomposition for orthogonal stock cutting problems
• An exact strip packing algorithm based on canonical forms
• Handling precedence constraints in scheduling problems by the sequence pair representation
• Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
• Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
• A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
• Compact visualisation of video summaries
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• New Approximability Results for 2-Dimensional Packing Problems
• Two-dimensional bin packing with one-dimensional resource augmentation
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
• A hybrid genetic algorithm for the two-dimensional single large object placement problem
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• A new exact method for the two-dimensional orthogonal packing problem
• A two-dimensional strip cutting problem with sequencing constraint
• Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
• Models and bounds for two-dimensional level packing problems
• Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
• A dynamic adaptive local search algorithm for the circular packing problem
• New lower bounds for bin packing problems with conflicts
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• Exact and heuristic methods for placing ships in locks
• Reactive GRASP for the strip-packing problem
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Quasi-phi-functions and optimal packing of ellipses
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Two-dimensional bin packing problems
• Heuristic algorithms for the three-dimensional bin packing problem
• Exhaustive approaches to 2D rectangular perfect packings
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• A least wasted first heuristic algorithm for the rectangular packing problem
• Heuristic placement routines for two-dimensional bin packing problem
• Bidimensional packing by bilinear programming
• Characterization and modelling of guillotine constraints
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
• Optimal aircraft load balancing
• An integrated cutting stock and sequencing problem
• A branch and bound algorithm for the strip packing problem
• Scheduling inspired models for two-dimensional packing problems
• An improved typology of cutting and packing problems
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

Describes a project that uses

Uses Software

• Tabu search

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)