Pages that link to "Item:Q724047"
From MaRDI portal
The following pages link to Algorithms for the one-dimensional two-stage cutting stock problem (Q724047):
Displaying 14 items.
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
- An LP-based approach to a two-stage cutting stock problem (Q1127213) (← links)
- Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722) (← links)
- Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
- A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← links)
- Modeling multistage cutting stock problems (Q1847197) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- Algorithms for the constrained two-staged two-dimensional cutting problem (Q2901006) (← links)
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336) (← links)
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
- Expectation analysis for bounding solutions of the 0-1 knapsack problem (Q6636466) (← links)
