Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
From MaRDI portal
Publication:4634978
DOI10.1007/978-3-319-18899-7_9zbMath1390.90470OpenAlexW2280720710MaRDI QIDQ4634978
L. Ozuna, Luis Infante, Igor S. Litvinchev
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_9
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
Parallel computing technologies for solving optimization problems of geometric design ⋮ Decomposition Algorithm for Irregular Placement Problems ⋮ Packing Convex 3D Objects with Special Geometric and Balancing Conditions ⋮ Packing ellipses in an optimized convex polygon ⋮ Irregular packing problems: a review of mathematical models ⋮ Optimized packing clusters of objects in a rectangular container ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis
Cites Work
- Packing circular-like objects in a rectangular container
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Packing unequal circles using formulation space search
- A literature review on circle and sphere packing problems: models and methodologies
- A heuristic for the circle packing problem with a variety of containers
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Integrated container loading software for pulp and paper industry
- Aggregation in large-scale optimization
- Integer programming formulations for approximate packing circles in a rectangular container
- Packing of unequal spheres and automated radiosurgical treatment planning
- Constraints in container loading -- a state-of-the-art review
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- A complete search method for the relaxed traveling tournament problem
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Irregular Packing Using the Line and Arc No-Fit Polygon
- A tutorial in irregular shape packing problems
- Assignment Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Packing congruent spheres into a multi‐connected polyhedral domain
- Multiple Container Packing: A Case Study of Pipe Packing
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
This page was built for publication: Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
