The stable set problem: Clique and nodal inequalities revisited
Authors:
- Adam N. LetchfordALAdam N. Letchford
- Fabrizio RossiFRFabrizio Rossi
- Stefano SmriglioSSStefano Smriglio
- 1 November 2020
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 123
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Exact Algorithms for Maximum Clique: A Computational Study Algorithms, 2012
- Strong lift-and-project cutting planes for the stable set problemMathematical Programming, 2012
- An application of the Lovász–Schrijver M(K, K) operator to the stable set problemMathematical Programming, 2008
- A new trust region technique for the maximum weight clique problemDiscrete Applied Mathematics, 2006
- Semidefinite programming relaxations for graph coloring and maximal clique problemsMathematical Programming, 2006
- Exploring the Relationship Between Max-Cut and Stable Set RelaxationsMathematical Programming, 2005
- A fast algorithm for the maximum clique problemDiscrete Applied Mathematics, 2002
- Antiweb-wheel inequalities and their separation problems over the stable set polytopesMathematical Programming, 2002
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 1965