Pages that link to "Item:Q1127213"
From MaRDI portal
The following pages link to An LP-based approach to a two-stage cutting stock problem (Q1127213):
Displayed 13 items.
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
- Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
- Modeling multistage cutting stock problems (Q1847197) (← links)
- Reel and sheet cutting at a paper mill (Q1885980) (← links)
- A combined cutting-stock and lot-sizing problem (Q1969834) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry (Q3055414) (← links)