Pages that link to "Item:Q2348062"

The following pages link to Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062):

Displaying 24 items.

• The cost of getting local monotonicity (Q322726) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
• The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
• On the characterization of weighted simple games (Q1698978) (← links)
• Correction to: ``On minimum sum representations for weighted voting games'' (Q1730597) (← links)
• Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• Bounds for the Nakamura number (Q2417421) (← links)
• Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
• On weights and quotas for weighted majority voting games (Q2669142) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← 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)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)