Pages that link to "Item:Q5931034"
From MaRDI portal
The following pages link to Exact algorithms for large-scale unconstrained two and three staged cutting problems (Q5931034):
Displaying 26 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- Exact algorithm for generating two-segment cutting patterns of punched strips (Q837733) (← links)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
- Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
- T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- A new dynamic programming procedure for three-staged cutting patterns (Q1941034) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- A bi-integrated model for coupling lot-sizing and cutting-stock problems (Q2063089) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns (Q2811482) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)