Constrained Infinite Group Relaxations of MIPs
From MaRDI portal
Publication:3083313
DOI10.1137/090754388zbMath1211.90142OpenAlexW2125198610MaRDI QIDQ3083313
Laurence A. Wolsey, Santanu S. Dey
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ba221ecbf42bf702096171426eb0b908b9578fd8
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Maximal Quadratic-Free Sets, Operations that Preserve the Covering Property of the Lifting Region, Theoretical challenges towards cutting-plane selection, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Intersection Disjunctions for Reverse Convex Sets, Computational Experiments with Cross and Crooked Cross Cuts, Unique lifting of integer variables in minimal inequalities, Outer-product-free sets for polynomial optimization and oracle-based cuts, On the Practical Strength of Two-Row Tableau Cuts, Strengthening lattice-free cuts using non-negativity, Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC, Sufficiency of cut-generating functions, A quantitative Doignon-Bell-Scarf theorem, Intersection cuts -- standard versus restricted, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Lifting convex inequalities for bipartite bilinear programs, The strength of multi-row aggregation cuts for sign-pattern integer programs, On the implementation and strengthening of intersection cuts for QCQPs, Lifting convex inequalities for bipartite bilinear programs, Cut-Generating Functions for Integer Variables, Cut-Generating Functions and S-Free Sets, A geometric approach to cut-generating functions, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets, Light on the infinite group relaxation. I: Foundations and taxonomy
