Pages that link to "Item:Q1871643"
From MaRDI portal
The following pages link to A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems (Q1871643):
Displayed 14 items.
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)