Pages that link to "Item:Q2583140"
From MaRDI portal
The following pages link to Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140):
Displaying 16 items.
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- Sequence independent lifting in mixed integer programming (Q1977865) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Sequence Independent Lifting for Mixed-Integer Programming (Q3637441) (← links)
- Sequence Independent Lifting for the Set of Submodular Maximization Problem (Q5041759) (← links)
- The continuous knapsack set (Q5962725) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
