Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods

DOI10.1007/978-3-319-64403-5zbMath1391.90002OpenAlexW2765593060MaRDI QIDQ1708742

Publication date: 26 March 2018

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-64403-5

zbMATH Keywords

cutting problems bin packing knapsack problems packing problems cutting stock container loading guillotine cutting pallet loading

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (26)

An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ A branch-and-bound approach for a vehicle routing problem with customer costs ⋮ Model development and solver demonstrations using randomized test problems ⋮ Decomposition Algorithm for Irregular Placement Problems ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Irregular packing problems: a review of mathematical models ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups ⋮ Improved flow-based formulations for the skiving stock problem

This page was built for publication: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods