Pages that link to "Item:Q3668310"

The following pages link to Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310):

Displaying 44 items.

• Error bounds for mixed integer linear optimization problems (Q263186) (← links)
• Error bounds for mixed integer nonlinear optimization problems (Q315475) (← links)
• Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
• Testing additive integrality gaps (Q378120) (← links)
• The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
• Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
• An instance of the cutting stock problem for which the rounding property does not hold (Q1080366) (← links)
• On the chromatic index of multigraphs and a conjecture of Seymour (I) (Q1084107) (← links)
• A simple strategy for solving a class of 0-1 integer programming models (Q1090232) (← links)
• The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
• Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040) (← links)
• Near-perfect matrices (Q1332310) (← links)
• Fractional and integral colourings (Q1363414) (← 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)
• Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
• Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
• Tighter relaxations for the cutting stock problem (Q1806682) (← links)
• Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
• Membership criteria and containments of powers of monomial ideals (Q2000797) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• Normality criteria for monomial ideals (Q2103343) (← links)
• A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
• The \(b\)-branching problem in digraphs (Q2192110) (← 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)
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
• Bounds for the Nakamura number (Q2417421) (← links)
• A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
• Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
• An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
• (Q2741357) (← links)
• A decomposition property of polyhedra (Q3703640) (← links)
• The cutting stock problem and integer rounding (Q3710296) (← links)
• Packing and covering with integral feasible flows in integral supply-demand networks (Q3790920) (← links)
• On some characterisations of totally unimodular matrices (Q3895600) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
• Integral decomposition in polyhedra (Q4740329) (← links)
• Sensitive Instances of the Cutting Stock Problem (Q4965102) (← links)
• (Q5005108) (← links)
• Non-interfering network flows (Q5056145) (← links)
• Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property (Q5090148) (← links)
• Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs (Q6045402) (← links)