Pages that link to "Item:Q1433163"
From MaRDI portal
The following pages link to Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163):
Displaying 9 items.
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints (Q367235) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- Manufacturer's mixed pallet design problem (Q2462174) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)
- A two-phase constructive algorithm for the single container mix-loading problem (Q6596958) (← links)
