Pages that link to "Item:Q1613404"
From MaRDI portal
The following pages link to Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404):
Displayed 17 items.
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Conservative scales in packing problems (Q1944876) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Friendly bin packing instances without integer round-up property (Q2340275) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
- Sensitive Instances of the Cutting Stock Problem (Q4965102) (← links)
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property (Q5090148) (← links)
- Nested \((2,3)\)-instances of the cutting stock problem (Q6134054) (← links)