Pages that link to "Item:Q2884299"

The following pages link to A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths (Q2884299):

Displaying 8 items.

• An approximation algorithm for the cutting-sticks problem (Q477614) (← links)
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
• Parameterized complexity of configuration integer programs (Q2670456) (← links)
• About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
• An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths (Q3569837) (← links)
• Polynomiality for Bin Packing with a Constant Number of Item Types (Q5056451) (← links)
• (Q5089171) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)