Pages that link to "Item:Q1127208"

The following pages link to The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208):

Displaying 33 items.

• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• An instance of the cutting stock problem for which the rounding property does not hold (Q1080366) (← 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)
• Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• Tighter relaxations for the cutting stock problem (Q1806682) (← links)
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• A rounding theorem for unique binary tomographic reconstruction (Q2274077) (← links)
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
• Bounds for the Nakamura number (Q2417421) (← links)
• Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
• Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem (Q2487734) (← links)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
• A note on the approximability of cutting stock problems (Q2643962) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• The cutting stock problem and integer rounding (Q3710296) (← links)
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
• The skiving stock problem as a counterpart of the cutting stock problem (Q4814101) (← 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)
• Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) (Q5189096) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise (Q6109850) (← links)