A Modeling-Based Approach for Non-standard Packing Problems
DOI10.1007/978-3-319-18899-7_4zbMath1384.90084OpenAlexW2240053161MaRDI QIDQ4634972
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_4
heuristicsconvex domainorthogonal packingpolygon approximationefficient formulationtetris-like itemsadditional/balancing conditionsfeasibility sub-problemglobal optimization (GO)mixed integer linear/nonlinear programming modelsspace-indexed/grid-based-position paradigms
Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Editorial: Total least squares and errors-in-variables modeling
- An analytical model for the container loading problem
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis
- Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
This page was built for publication: A Modeling-Based Approach for Non-standard Packing Problems
