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

DOI10.1007/978-3-319-64403-5MaRDI QIDQ1708742zbMATH OpenOpenAlexFDO

Authors Guntram Scheithauer

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

bin packingknapsack problemspacking problemscutting stockcontainer loadingguillotine cuttingcutting problemspallet loading

Mathematics Subject Classification ID

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

Recommendations

• Cutting and packing optimization. Problems modeling and solution methods.
• Intelligent algorithms for packing and cutting problem
• scientific article; zbMATH DE number 4074379
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Solving Non-standard Packing Problems by Global Optimization and Heuristics

Cited in

(37)

• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
• Exact solution techniques for two-dimensional cutting and packing
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• An introduction to the two‐dimensional rectangular cutting and packing problem
• scientific article; zbMATH DE number 4074379 (Why is no real title available?)
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
• Improved flow-based formulations for the skiving stock problem
• Decomposition algorithm for irregular placement problems
• A heuristic-based reduction for the temporal bin packing problem with fire-ups
• Packing convex polygons in minimum-perimeter convex hulls
• scientific article; zbMATH DE number 3854763 (Why is no real title available?)
• Solving a large cutting problem in the glass manufacturing industry
• An introduction to stochastic bin packing-based server consolidation with conflicts
• Irregular packing problems: a review of mathematical models
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
• A branch-and-bound approach for a vehicle routing problem with customer costs
• The skiving stock problem and its relation to hypergraph matchings
• On tackling reverse convex constraints for non-overlapping of unequal circles
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Models for two-dimensional bin packing problems with customer order spread
• An improved typology of cutting and packing problems
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
• A combinatorial flow-based formulation for temporal bin packing problems
• Cutting and packing optimization. Problems modeling and solution methods.
• A typology of cutting and packing problems
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• Optimization and Optimal Control Approach to Japanese Sangaku Six Equal Circles Problem
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
• Mathematical models and approximate solution approaches for the stochastic bin packing problem
• Model development and solver demonstrations using randomized test problems
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
• Intelligent algorithms for packing and cutting problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708742)