Strong lift-and-project cutting planes for the stable set problem
- 21 January 2012
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 141 (1-2) , 165-192
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A note on the selection of Benders’ cutsMathematical Programming, 2010
- An application of the Lovász–Schrijver M(K, K) operator to the stable set problemMathematical Programming, 2008
- Valid inequalities for mixed integer linear programsMathematical Programming, 2007
- Semidefinite programming relaxations for graph coloring and maximal clique problemsMathematical Programming, 2006
- Solving Lift-and-Project Relaxations of Binary Integer ProgramsSIAM Journal on Optimization, 2006
- Exploring the Relationship Between Max-Cut and Stable Set RelaxationsMathematical Programming, 2005
- Antiweb-wheel inequalities and their separation problems over the stable set polytopesMathematical Programming, 2002
- Polyhedral methods for the maximum clique problem1996
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962