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)
- Irregular packing: MILP model based on a polygonal enclosure
- A beam search algorithm for the biobjective container loading problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Routing problems with loading constraints
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A beam search implementation for the irregular shape packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A linear optimization approach to the combined production planning model
- New lower bounds for bin packing problems with conflicts
- Quasi-phi-functions and optimal packing of ellipses
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- The one-dimensional cutting stock problem with due dates
- Phi-functions for 2D objects formed by line segments and circular arcs
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A heuristic for solving large bin packing problems in two and three dimensions
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A hybrid algorithm for constrained order packing
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A survey of dual-feasible and superadditive functions
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- The multiple container loading cost minimization problem
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- A hybrid placement strategy for the three-dimensional strip packing problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- 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
- The stochastic trim-loss problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Computing stable loads for pallets
- A recursive algorithm for constrained two-dimensional cutting problems
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Reactive GRASP for the strip-packing problem
- A branch and bound algorithm for the strip packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- An application of deterministic and robust optimization in the wood cutting industry
- Heuristics for container loading of furniture
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Optimal clustering of a pair of irregular objects
- A typology of cutting and packing problems
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- A reference length approach for the 3D strip packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- Space defragmentation for packing problems
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Integer linear programming for a cutting problem in the wood-processing industry: a case study
- A caving degree approach for the single container loading problem
- Accelerating column generation for variable sized bin-packing problems
- An integrated cutting stock and sequencing problem
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
- Dynamic reduction heuristics for the rectangle packing area minimization problem
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- 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 two-dimensional strip cutting problem with sequencing constraint
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- BPPLIB: a library for bin packing and cutting stock problems
- Minimizing the object dimensions in circle and sphere packing problems
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Models and algorithms for three-stage two-dimensional bin packing
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A dynamic adaptive local search algorithm for the circular packing problem
- A heuristic for the three-dimensional strip packing problem
- Computing the asymptotic worst-case of bin packing lower bounds
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- Packing cubes into a cube is NP-complete in the strong sense
- An investigation into two bin packing problems with ordering and orientation implications
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
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)
