Approximate packing: integer programming models, valid inequalities and nesting
From MaRDI portal
Recommendations
- Packing circular-like objects in a rectangular container
- Integer programming formulations for approximate packing circles in a rectangular container
- Mixed-integer programming models for nesting problems
- Irregular packing: MILP model based on a polygonal enclosure
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
Cites work
- A complete search method for the relaxed traveling tournament problem
- A heuristic for the circle packing problem with a variety of containers
- A literature review on circle and sphere packing problems: models and methodologies
- A tutorial in irregular shape packing problems
- Aggregation in large-scale optimization
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Assignment Problems
- Constraints in container loading -- a state-of-the-art review
- Integer programming formulations for approximate packing circles in a rectangular container
- Integrated container loading software for pulp and paper industry
- Irregular packing using the line and arc no-fit polygon
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Multiple Container Packing: A Case Study of Pipe Packing
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Packing circular-like objects in a rectangular container
- Packing congruent spheres into a multi‐connected polyhedral domain
- Packing of unequal spheres and automated radiosurgical treatment planning
- Packing unequal circles using formulation space search
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
Cited in
(12)- Integer programming formulations for approximate packing circles in a rectangular container
- Parallel computing technologies for solving optimization problems of geometric design
- Mixed-integer programming models for nesting problems
- 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
- About the Structure of the Integer Cone and Its Application to Bin Packing
- Packing circular-like objects in a rectangular container
- Decomposition algorithm for irregular placement problems
- Packing convex 3D objects with special geometric and balancing conditions
- A skyline-based heuristic for orthogonal packing rectangles in a circle
This page was built for publication: Approximate packing: integer programming models, valid inequalities and nesting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634978)
