Pages that link to "Item:Q5907039"
From MaRDI portal
The following pages link to Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5907039):
Displaying 22 items.
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- Surveys in operations research (Q1730527) (← links)
- Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
- Eleven surveys in operations research (Q2480255) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond (Q2819232) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case (Q4637826) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
