Pages that link to "Item:Q1603313"
From MaRDI portal
The following pages link to Row and column generation technique for a multistage cutting stock problem (Q1603313):
Displaying 13 items.
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Analysis of programming properties and the row-column generation method for 1-norm support vector machines (Q460673) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
- Modeling multistage cutting stock problems (Q1847197) (← links)
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- An integer linear optimization model to the compartmentalized knapsack problem (Q6088172) (← links)
