Pages that link to "Item:Q974981"
From MaRDI portal
The following pages link to Equivalence between intersection cuts and the corner polyhedron (Q974981):
Displaying 22 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Sufficiency of cut-generating functions (Q494318) (← links)
- Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\) (Q526839) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem (Q2020605) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Cut-Generating Functions for Integer Variables (Q2833108) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
