Stable sets, corner polyhedra and the Chvàtal closure
From MaRDI portal
Publication:1043240
DOI10.1016/j.orl.2009.06.006zbMath1180.90183OpenAlexW2154717459MaRDI QIDQ1043240
Cornuéjols, Gérard, Manoel B. Campêlo
Publication date: 7 December 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.06.006
Related Items
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, When the Gomory-chvátal closure coincides with the integer hull, How tight is the corner relaxation? Insights gained from the stable set problem, The Hirsch conjecture for the fractional stable set polytope, Can Cut-Generating Functions Be Good and Efficient?, On the Circuit Diameter of Some Combinatorial Polytopes, The strength of Dantzig-Wolfe reformulations for the stable set and related problems
Cites Work
- Unnamed Item
- The stable set polytope of quasi-line graphs
- Matrices with the Edmonds-Johnson property
- Split closure and intersection cuts
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the facets of mixed integer programs with two integer variables and two constraints
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Minimal Valid Inequalities for Integer Constraints
- Outline of an algorithm for integer solutions to linear programs
- On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
- Properties of vertex packing and independence system polyhedra
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
