Irregular packing problems: a review of mathematical models
From MaRDI portal
Publication:2286866
DOI10.1016/j.ejor.2019.04.045zbMath1431.90133OpenAlexW2944379335WikidataQ127905024 ScholiaQ127905024MaRDI QIDQ2286866
José Fernando Oliveira, Maria Antónia Carravilla, Franklina Maria Bragion Toledo, Aline A. S. Leão, Ramón Alvarez-Valdés
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.045
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Related Items
Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, Extracting maximal objects from three-dimensional solid materials, Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning, An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations, Cutting and packing problems under uncertainty: literature review and classification framework, A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands, Heuristics for the two-dimensional irregular bin packing problem with limited rotations, Packing convex polygons in minimum-perimeter convex hulls, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects, 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, Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning, Exact solution techniques for two-dimensional cutting and packing, Sparsest balanced packing of irregular 3D objects in a cylindrical container, Sparse balanced layout of spherical voids in three-dimensional domains, Optimized filling of a given cuboid with spherical powders for additive manufacturing, A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
Cites Work
- Irregular packing: MILP model based on a polygonal enclosure
- Quasi-phi-functions and optimal packing of ellipses
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Algorithms for nesting with defects
- Phi-functions for 2D objects formed by line segments and circular arcs
- Packing circular-like objects in a rectangular container
- Tools of mathematical modeling of arbitrary object packing problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Cutting circles and polygons from area-minimizing rectangles
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A clique covering MIP model for the irregular strip packing problem
- A customized branch-and-bound approach for irregular shape nesting
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Matheuristics for the irregular bin packing problem with free rotations
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Optimal clustering of a pair of irregular objects
- A fully general, exact algorithm for nesting irregular shapes
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Irregular Packing Using the Line and Arc No-Fit Polygon
- A tutorial in irregular shape packing problems
- Modeling of packing problems
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
- Optimized Object Packings Using Quasi-Phi-Functions
- Solving nesting problems with non-convex polygons by constraint logic programming
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Constraint Programming
- A Multi-sphere Scheme for 2D and 3D Packing Problems
- Polygon decomposition for efficient construction of Minkowski sums
