The following pages link to (Q4848284):
Displayed 12 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)