Pages that link to "Item:Q1029557"
From MaRDI portal
The following pages link to MIP-based heuristic for non-standard 3D-packing problems (Q1029557):
Displaying 14 items.
- Modeling close packing of 3D objects (Q315021) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items (Q1885342) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- Packing different cuboids with rotations and spheres into a cuboid (Q2260526) (← links)
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances (Q2263288) (← links)
- Approximated solutions to a 3D-packing MIP model by a non-linear approach (Q3457559) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- Optimized Object Packings Using Quasi-Phi-Functions (Q4634983) (← links)
- Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints (Q5270072) (← links)
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)
- Solving Non-standard Packing Problems by Global Optimization and Heuristics (Q5402137) (← links)
