Packing problems in space solved by CPLEX: an experimental analysis
From MaRDI portal
Recommendations
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A global optimization point of view to handle non-standard object packing problems
- A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
- scientific article; zbMATH DE number 2050783
- A modeling-based approach for non-standard packing problems
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1131473 (Why is no real title available?)
- scientific article; zbMATH DE number 2050771 (Why is no real title available?)
- A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- A heuristic approach for packing identical rectangles in convex regions
- A modeling-based approach for non-standard packing problems
- A tutorial in irregular shape packing problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An analytical model for the container loading problem
- Approximate packing: integer programming models, valid inequalities and nesting
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- CAST: a successful project in support of the international space station logistics
- Computational Complexity
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Cutting and packing problems with placement constraints
- Cutting circles and polygons from area-minimizing rectangles
- Efficiently packing unequal disks in a circle
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Heuristics for the container loading problem
- Hybrid metaheuristics. An emerging approach to optimization.
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- Modeling and optimization in space engineering.
- On the global minimum in a balanced circular packing problem
- On the two-dimensional knapsack problem
- Optimization models for the three-dimensional container loading problem with practical constraints
- Optimized object packings using quasi-phi-functions
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packing optimization of free-form objects in engineering design
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance
- Quasi-phi-functions and optimal packing of ellipses
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- Solving circle packing problems by global optimization: numerical results and industrial applications
- TOPOS -- A new constructive algorithm for nesting problems
- The Three-Dimensional Bin Packing Problem
- The two-dimensional bin packing problem with variable bin sizes and costs
Cited in
(6)- scientific article; zbMATH DE number 2050783 (Why is no real title available?)
- A global optimization point of view to handle non-standard object packing problems
- CAST: a successful project in support of the international space station logistics
- A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
- Applying spatial representation techniques to the container packing problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
This page was built for publication: Packing problems in space solved by CPLEX: an experimental analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133910)
