Pages that link to "Item:Q1761965"
From MaRDI portal
The following pages link to Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965):
Displaying 12 items.
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Order and static stability into the strip packing problem (Q2259026) (← links)
- The exact solutions of several types of container loading problems (Q2301942) (← links)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
- Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids (Q6094360) (← links)
