Pages that link to "Item:Q3221736"
From MaRDI portal
The following pages link to Bounds for Two-Dimensional Cutting (Q3221736):
Displaying 11 items.
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
- Packing problems (Q1197916) (← links)
- An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- The geometry of nesting problems: a tutorial (Q2384608) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
- A new upper bound for unconstrained two-dimensional cutting and packing (Q4656659) (← links)