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 4 items.
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← 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)
