Pages that link to "Item:Q2643945"
From MaRDI portal
The following pages link to An improved typology of cutting and packing problems (Q2643945):
Displayed 36 items.
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- A caving degree approach for the single container loading problem (Q2378453) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- A new lower bound for the non-oriented two-dimensional bin-packing problem (Q2467479) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic (Q2643955) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- A heuristic for the three-dimensional strip packing problem (Q2643958) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- A note on the approximability of cutting stock problems (Q2643962) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A two-dimensional strip cutting problem with sequencing constraint (Q2643967) (← links)
- Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
- Roll cutting in the curtain industry, or: a well-solvable allocation problem (Q2643970) (← links)
- Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)