Pages that link to "Item:Q1298738"

The following pages link to New cases of the cutting stock problem having MIRUP (Q1298738):

Displaying 10 items.

• On the bin packing problem with a fixed number of object weights (Q872247) (← 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)
• Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
• Tighter relaxations for the cutting stock problem (Q1806682) (← 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)
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)