Pages that link to "Item:Q3637441"
From MaRDI portal
The following pages link to Sequence Independent Lifting for Mixed-Integer Programming (Q3637441):
Displaying 24 items.
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Sequence independent lifting in mixed integer programming (Q1977865) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Risk-averse shortest path interdiction (Q2830955) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Sequence Independent Lifting for the Set of Submodular Maximization Problem (Q5041759) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)