Pages that link to "Item:Q5090148"

The following pages link to Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property (Q5090148):

Displaying 9 items.

• The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
• An instance of the cutting stock problem for which the rounding property does not hold (Q1080366) (← links)
• The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
• Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
• Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem (Q2487734) (← links)
• The cutting stock problem and integer rounding (Q3710296) (← links)