A typology of cutting and packing problems
From MaRDI portal
Publication:1825761
DOI10.1016/0377-2217(90)90350-KzbMath0684.90076OpenAlexW1979415050MaRDI QIDQ1825761
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90350-k
Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
Procedures for solving a 1-dimensional cutting problem ⋮ Integrated container loading software for pulp and paper industry ⋮ 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 ⋮ An interactive technique for the cutting stock problem with multiple objectives ⋮ On the effectivity of gradient methods for cutting stock problems ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ Cutting optimization of structural tubes to build agricultural light aircrafts ⋮ Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ A survey on single crane scheduling in automated storage/retrieval systems ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ A multi-objective programming approach to 1.5-dimensional assortment problem ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts ⋮ Optimization of roll cutting in clothing industry ⋮ Simplest optimal cutting patterns for equal rectangles ⋮ The constrained compartmentalised knapsack problem ⋮ Palletisation efficiency as a criterion for product design ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ An application of simulated annealing to the cutting stock problem ⋮ A sequential heuristic procedure for one-dimensional cutting ⋮ Regular packing of congruent polygons on the rectangular sheet ⋮ On the complexity of adjacent resource scheduling ⋮ Compaction and separation algorithms for non-convex polygons and their applications ⋮ The modified integer round-up property of the one-dimensional cutting stock problem ⋮ CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem ⋮ An LP-based approach to a two-stage cutting stock problem ⋮ An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems ⋮ Exact solutions for constrained two-dimensional cutting problems ⋮ Guillotineable bin packing: A genetic approach ⋮ How to use structural constraints to compute an upper bound for the pallet loading problem ⋮ Loading plates with non-identical items ⋮ Allowing for weight considerations in container loading ⋮ Cut scheduling in the apparel industry ⋮ An analytical model for the container loading problem ⋮ Nesting planning based on production priorities and technological efficiency ⋮ Bounds for nested knapsack problems ⋮ Bun splitting: a practical cutting stock problem ⋮ Space and time allocation in a shipyard assembly hall ⋮ On the cutting stock problem under stochastic demand ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ Generalized hyper-heuristics for solving 2D regular and irregular packing problems ⋮ An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts ⋮ An exact algorithm for general, orthogonal, two-dimensional knapsack problems ⋮ A novel hybrid tabu search approach to container loading ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ The cutting stock problem in a hardboard industry: A case study. ⋮ Exact algorithms for the guillotine strip cutting/packing problem. ⋮ A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ Rectangle packing with additional restrictions ⋮ Improving competitiveness in veneers production by a simple-to-use DSS. ⋮ Layer-layout-based heuristics for loading homogeneous items into a single container ⋮ Trim loss optimization by an improved differential evolution ⋮ A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Cutting stock problems and solution procedures ⋮ Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders) ⋮ Reactive GRASP for the strip-packing problem ⋮ Bin packing with fragmentable items: presentation and approximations ⋮ Solving sequential interval cutting problems via dynamic programming ⋮ Packing problems ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Chips on wafers, or packing rectangles into grids ⋮ A two-objective mathematical model without cutting patterns for one-dimensional assortment problems ⋮ Average-case analysis of cutting and packing in two dimensions ⋮ A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ The stochastic trim-loss problem ⋮ Solution for the constrained Guillotine cutting problem by simulated annealing ⋮ Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem ⋮ The solution of two-stage guillotine cutting stock problems having extremely varying order demands ⋮ Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach ⋮ Setup minimising conditions in the trim loss problem ⋮ Column enumeration based decomposition techniques for a class of non-convex MINLP problems ⋮ Cutting circles and polygons from area-minimizing rectangles ⋮ The one-dimensional cutting stock problem with due dates ⋮ 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 ⋮ The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming ⋮ 4-block heuristic for the rectangle packing problem ⋮ An exact depth-first algorithm for the pallet loading problem ⋮ Stability aspects of pallet loading ⋮ Software zur Verpackungslogistik. Übersicht und Vergleich. (Software for the logistics of packing) ⋮ Enforcing minimum run length in the cutting stock problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact methods for the knapsack problem and its generalizations
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- Optimal and canonical solutions of the change making problem
- The trim-loss and assortment problems: A survey
- Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979)
- Assembly line balancing as generalized bin packing
- An LP-based approach to cutting stock problems with multiple objectives
- A computer-based heuristic for packing pooled shipment containers
- Load planning for shipments of low density products
- The dissection of rectangles into squares
- Mathematical Methods of Organizing and Planning Production
- A Linear Programming Approach to the Cutting-Stock Problem
- Performance testing of rectangular parts-nesting heuristics
- Two-Dimensional Finite Bin-Packing Algorithms
- The knapsack problem: A survey
- An Application of Bin-Packing to Multiprocessor Scheduling
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
- Discrete-Variable Extremum Problems
- The Loading Problem
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
This page was built for publication: A typology of cutting and packing problems
