Pages that link to "Item:Q922950"
From MaRDI portal
The following pages link to Chvátal closures for mixed integer programming problems (Q922950):
Displaying 50 items.
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- The rank of (mixed-) integer polyhedra (Q1942280) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- The split closure of a strictly convex body (Q2275578) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- The splittable flow arc set with capacity and minimum load constraints (Q2450712) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- Mixed-integer sets from two rows of two adjacent simplex bases (Q2638388) (← links)
- A constructive characterization of the split closure of a mixed integer linear program (Q2643814) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Two-halfspace closure (Q2689824) (← links)
- The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- Rank of random half-integral polytopes. Extended abstract (Q2883588) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- A note on the Chvátal-rank of clique family inequalities (Q3004203) (← links)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
