Pages that link to "Item:Q1586209"
From MaRDI portal
The following pages link to Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209):
Displayed 13 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Integer-programming software systems (Q817202) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Towards optimal formwork pairing on construction sites (Q3515391) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) (Q5941313) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)