Constrained infinite group relaxations of MIPs

DOI10.1137/090754388zbMATH Open1211.90142OpenAlexW2125198610MaRDI QIDQ3083313FDOQ3083313

Authors: 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

Recommendations

• On the extreme inequalities of infinite group problems
• Minimal valid inequalities for integer constraints
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Integer Programming and Combinatorial Optimization
• The group-theoretic approach in mixed integer programming

zbMATH Keywords

cutting planesinfinite group relaxationsmixed integer programs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Cited In (30)

• On a generalization of the Chvátal-Gomory closure
• Unique lifting of integer variables in minimal inequalities
• On the practical strength of two-row tableau cuts
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• Maximal quadratic-free sets
• Maximal quadratic-free sets
• A quantitative Doignon-Bell-Scarf theorem
• On the extreme inequalities of infinite group problems
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• Strengthening lattice-free cuts using non-negativity
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Theoretical challenges towards cutting-plane selection
• The group-theoretic approach in mixed integer programming
• Minimal valid inequalities for integer constraints
• Cut-generating functions and \(S\)-free sets
• Sufficiency of cut-generating functions
• Operations that preserve the covering property of the lifting region
• On the implementation and strengthening of intersection cuts for QCQPs
• A geometric approach to cut-generating functions
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• Standard pairs and group relaxations in integer programming
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC
• Cut-generating functions for integer variables
• Computational experiments with cross and crooked cross cuts
• Intersection Disjunctions for Reverse Convex Sets
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
• Intersection cuts -- standard versus restricted

This page was built for publication: Constrained infinite group relaxations of MIPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083313)