How tight is the corner relaxation?
From MaRDI portal
Publication:951100
DOI10.1016/j.disopt.2006.11.010zbMath1151.90030OpenAlexW2020662107MaRDI QIDQ951100
Matteo Fischetti, Michele Monaci
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.11.010
Related Items
Mixed-integer cuts from cyclic groups, How tight is the corner relaxation? Insights gained from the stable set problem, On a generalization of the master cyclic group polyhedron, Intersection cuts for convex mixed integer programs from translated cones, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, Unnamed Item, On the complexity of surrogate and group relaxation for integer linear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Mixed-integer cuts from cyclic groups
- Gomory integer programs
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- On the facets of the mixed-integer knapsack polyhedron
- Binary clutter inequalities for integer programs
- Extended formulations for Gomory corner polyhedra
- Some polyhedra related to combinatorial problems
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
