Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
bin packingcontainer loadingcutting problemscutting stockguillotine cuttingknapsack problemspacking problemspallet loading
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)
The authors provide a comprehensive textbook about the cutting and packing problems. To be more specific, they consider in particular: knapsack problems, cutting stock problems, bin packing problems, feasibility problems, patterns of rectangular pieces, pallet loading problems and container loading problems. They provide both mathematical models and solution methods. Each chapter is followed by a number of exercises (with solutions), which makes the reading and understanding of the book much easier. The book is a good choice for students of mathematics, IT or engineering, researchers in the area of optimization as well as the preconditions dealing with problems of this kind.
- 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
- The skiving stock problem and its relation to hypergraph matchings
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- A typology of cutting and packing problems
- 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
- 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
- Intelligent algorithms for packing and cutting problem
- An introduction to stochastic bin packing-based server consolidation with conflicts
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
- Solving a large cutting problem in the glass manufacturing industry
- Irregular packing problems: a review of mathematical models
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Improved flow-based formulations for the skiving stock problem
- An improved typology of cutting and packing problems
- 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
- Packing convex polygons in minimum-perimeter convex hulls
- Model development and solver demonstrations using randomized test problems
- scientific article; zbMATH DE number 3854763 (Why is no real title available?)
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Decomposition algorithm for irregular placement problems
- Optimal Packing Problems: From Knapsack Problem to Open Dimension 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
- A combinatorial flow-based formulation for temporal bin packing problems
- A branch-and-bound approach for a vehicle routing problem with customer costs
- 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
- A heuristic-based reduction for the temporal bin packing problem with fire-ups
- Models for two-dimensional bin packing problems with customer order spread
- On the multiple optimal solutions and patterns of the pallet loading problem
- Mathematical models and heuristic algorithms for pallet building problems with practical constraints
- Mathematical models based on decision hypergraphs for designing a storage cabinet
- Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
- Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
- Cutting and packing optimization. Problems modeling and solution methods.
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)
