Cutting and Packing Problems with Placement Constraints
From MaRDI portal
Publication:4634975
DOI10.1007/978-3-319-18899-7_6zbMath1390.90462OpenAlexW2223367862MaRDI QIDQ4634975
Guntram Scheithauer, Andreas Fischer
Publication date: 13 April 2018
Published in: Optimized Packings with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18899-7_6
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)
Related Items (3)
Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Improved flow-based formulations for the skiving stock problem ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis
Cites Work
- Unnamed Item
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Cutting and packing optimization. Problems modeling and solution methods.
- Integrated defect detection and optimization for cross cutting of wooden boards
- A method for the cutting stock problem with different qualities
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- An improved typology of cutting and packing problems
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Guillotine cutting of defective boards
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- The solution of packing problems with pieces variable length and additional allocation constraints
- Multistage Cutting Stock Problems of Two and More Dimensions
- Finding the Shortest Route between Two Points in a Network
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: Cutting and Packing Problems with Placement Constraints
