Pages that link to "Item:Q1885342"
From MaRDI portal
The following pages link to A MIP approach for some practical packing problems: balancing constraints and tetris-like items (Q1885342):
Displayed 14 items.
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
- A new load balance methodology for container loading problem in road transportation (Q1754193) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems (Q2003558) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- A data-driven approach for mixed-case palletization with support (Q2168642) (← links)
- Data Structures for Higher-Dimensional Rectilinear Packing (Q2815459) (← links)
- Placement of two- and three-dimensional irregular shapes for inertia moment and balance (Q3401333) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- A large neighbourhood search algorithm for solving container loading problems (Q6109572) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)