The following pages link to A two-phase roll cutting problem (Q1825752):
Displayed 16 items.
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- A sequential heuristic procedure for one-dimensional cutting (Q1124716) (← links)
- An LP-based approach to a two-stage cutting stock problem (Q1127213) (← links)
- An algorithm for the determination of optimal cutting patterns (Q1348556) (← links)
- Optimization of roll cutting in clothing industry (Q1366704) (← links)
- Heuristic methods for gang-rip saw arbor design. (Q1420446) (← links)
- Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- Modeling multistage cutting stock problems (Q1847197) (← links)
- Reel and sheet cutting at a paper mill (Q1885980) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
- A column generation procedure for gang-rip saw arbor design and scheduling (Q4230062) (← links)