Pages that link to "Item:Q1886734"
From MaRDI portal
The following pages link to Generating optimal T-shape cutting patterns for circular blanks (Q1886734):
Displaying 17 items.
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← 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)
- Simplest optimal guillotine cutting patterns for strips of identical circles (Q927192) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- Dynamic programming algorithms for generating optimal strip layouts (Q2506184) (← links)
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
- A simple algorithm for generating optimal equal circle cutting patterns with minimum sections (Q2654515) (← links)
- A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems (Q3605433) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- Recursive algorithm for the two‐dimensional cutting problem of punched strips (Q5190526) (← links)
