Pages that link to "Item:Q5675140"
From MaRDI portal
The following pages link to Integer programming and convex analysis: Intersection cuts from outer polars (Q5675140):
Displaying 12 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
- The geometry of optimal transportation (Q1373007) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Spherical cuts for integer programming problems (Q3499437) (← links)
- Polyhedral polarity defined by a general bilinear inequality (Q3937166) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems (Q6491343) (← links)
