Pages that link to "Item:Q1847193"
From MaRDI portal
The following pages link to A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193):
Displayed 11 items.
- One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
- Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- An optimization model for trim loss minimization in an automotive glass plant (Q2643973) (← links)