An improved typology of cutting and packing problems
From MaRDI portal
Publication:2643945
DOI10.1016/J.EJOR.2005.12.047zbMATH Open1278.90347OpenAlexW2105175235MaRDI QIDQ2643945FDOQ2643945
Authors: Gerhard Wäscher, Heike Haußner, Holger Schumann 
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.047
Recommendations
- A typology of cutting and packing problems
- A survey on the cutting and packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Cutting and packing problems with placement constraints
- Cutting and packing optimization. Problems modeling and solution methods.
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A Hybrid Optimization Framework for Cutting and Packing Problems
- Exact solution techniques for two-dimensional cutting and packing
- On packing \(T\)-cuts
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- An exact algorithm for large multiple knapsack problems
- TOPOS -- A new constructive algorithm for nesting problems
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Compaction and separation algorithms for non-convex polygons and their applications
- On genetic algorithms for the packing of polygons
- Title not available (Why is that?)
- Heuristic algorithms for the three-dimensional bin packing problem
- Algorithms for the variable sized bin packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Applied simulated annealing
- Title not available (Why is that?)
- Two-dimensional packing problems: a survey
- Algorithms for on-line bin-packing problems with cardinality constraints
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Guillotineable bin packing: A genetic approach
- On the two-dimensional knapsack problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- An efficient approach for the multi-pallet loading problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for the pallet loading problem
- A typology of cutting and packing problems
- A bottleneck assignment approach to the multiple container loading problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Exact solution of the two-dimensional finite bin packing problem
- Guided local search for the three-dimensional bin-packing problem
- An exact approach to the strip-packing problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Recent advances on two-dimensional bin packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- A heuristic for multiple container loading problems
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Heuristics for the container loading problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An analytical model for the container loading problem
- Approximate algorithms for constrained circular cutting problems
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Loading plates with non-identical items
- Packing different-sized circles into a rectangular container
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- A tabu search algorithm for weakly heterogeneous container loading problems
- Solving binary cutting stock problems by column generation and branch- and-bound
- A comparative evaluation of heuristics for container loading
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Bounds for Two-Dimensional Cutting
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- A New Linear Programming Approach to the Cutting Stock Problem
- A Method for Solving Container Packing for a Single Size of Box
- A hybrid genetic algorithm for the container loading problem
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- Models and bounds for two-dimensional level packing problems
- An algorithm for a cutting stock problem on a strip
- Title not available (Why is that?)
- Annealing, Cylinder Packing By Simulated
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A method of optimal lattice packing of congruent oriented polygons in the plane
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- On fuzzy random linear knapsack problems
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Loading Multiple Pallets
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Cutting optimization with variable-sized stock and inventory status data
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- A new upper bound for the cylinder packing problem
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Cube packing.
- Establishing the optimality of sequencing heuristics for cutting stock problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Improved heuristics for sequencing cutting patterns
- A combined cutting-stock and lot-sizing problem
- An LP-based approach to cutting stock problems with multiple objectives
- Binary knapsack problems with random budgets
- The growth of m-constraint random knapsacks
- Approximation algorithms for extensible bin packing
- Evaluation of algorithms for one-dimensional cutting
- A sequential heuristic procedure for one-dimensional cutting
- 4-block heuristic for the rectangle packing problem
- Allowing for weight considerations in container loading
- A Multistage Solution of the Template-Layout Problem
- A Local Optimization-based Solution to the Rectangle Layout Problem
- Solution procedures for cutting lumber into furniture parts
- Title not available (Why is that?)
- Solving nesting problems with non-convex polygons by constraint logic programming
- 3D random stacking of weakly heterogeneous palletization problems
- On-line packing with boxes of different sizes
Cited In (only showing first 100 items - show all)
- An analysis of the integrated lot-sizing and cutting-stock problem formulation
- Exact solution techniques for two-dimensional cutting and packing
- The exact solutions of several types of container loading problems
- A fast heuristic for a three-dimensional non-convex domain loading problem
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Container loading with multi-drop constraints
- Conservative scales in packing problems
- Cutting optimization of structural tubes to build agricultural light aircrafts
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- Layout optimisation for an installation port of an offshore wind farm
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- Solving a large multicontainer loading problem in the car manufacturing industry
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Optimized packing multidimensional hyperspheres: a unified approach
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A new load balance methodology for container loading problem in road transportation
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- Improved flow-based formulations for the skiving stock problem
- Algorithms for the one-dimensional two-stage cutting stock problem
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Simultaneous optimization of production planning and inventory management of polyurethane foam plant
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
- Comments on: Routing problems with loading constraints
- Bun splitting: a practical cutting stock problem
- Models and algorithms for fair layout optimization problems
- Recursive circle packing problems
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- LP bounds in various constraint programming approaches for orthogonal packing
- Mathematical modeling of distance constraints on two-dimensional \(\varphi\)-objects
- A reinforcement learning approach to the stochastic cutting stock problem
- Trim loss optimization by an improved differential evolution
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- A novel hybrid tabu search approach to container loading
- A local search-based method for sphere packing problems
- The min-conflict packing problem
- The pallet loading problem: a review of solution methods and computational experiments
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- A collision detection approach for maximizing the material utilization
- Preface to the special issue on cutting and packing
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- Rectangle packing with additional restrictions
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A heuristic approach for packing identical rectangles in convex regions
- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- Cutting and packing problems with placement constraints
- A global search framework for practical three-dimensional packing with variable carton orientations
- Efficient algorithms for real-life instances of the variable size bin packing problem
- A survey on the cutting and packing problems
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Roll cutting in the curtain industry, or: a well-solvable allocation problem
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A note on the approximability of cutting stock problems
- Optimized object packings using quasi-phi-functions
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- A large neighbourhood search algorithm for solving container loading problems
- Collaborative urban transportation: recent advances in theory and practice
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A two-stage packing problem procedure
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- Application of optimization for solving a sawing stock problem with a cant sawing pattern
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Modeling two-dimensional guillotine cutting problems via integer programming
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A residual recombination heuristic for one-dimensional cutting stock problems
- Packing convex polygons in minimum-perimeter convex hulls
- A memetic algorithm to pack unequal circles into a square
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- A clique covering MIP model for the irregular strip packing problem
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Matheuristics for the irregular bin packing problem with free rotations
- The load planning problem for double-stack intermodal trains
- A model‐based heuristic to the vehicle routing and loading problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- The skiving stock problem and its relation to hypergraph matchings
- The pallet loading problem: three-dimensional bin packing with practical constraints
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- A customized branch-and-bound approach for irregular shape nesting
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Exact approaches for the cutting path determination problem
- Packing unit spheres into a cube using VNS
Uses Software
This page was built for publication: An improved typology of cutting and packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643945)
