Pages that link to "Item:Q2487734"
From MaRDI portal
The following pages link to Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem (Q2487734):
Displaying 6 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Local search of orthogonal packings using the lower bounds (Q1040483) (← links)
- An instance of the cutting stock problem for which the rounding property does not hold (Q1080366) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- The cutting stock problem and integer rounding (Q3710296) (← links)
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property (Q5090148) (← links)