Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
Open Access
- 10 June 2016
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 162 (1-2) , 201-223
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
- CONICET (PID-CONICET 241)
- ANPCyT (PICT-ANPCyT 0361)
- Office of Naval Research Global (N00014-12-10049)
This publication has 27 references indexed in Scilit:
- On the facets of lift-and-project relaxations under graph operationsDiscrete Applied Mathematics, 2014
- Lovász-Schrijver SDP-operator and a superclass of near-perfect graphsElectronic Notes in Discrete Mathematics, 2013
- Near-perfect graphs with polyhedral N+(G)Electronic Notes in Discrete Mathematics, 2011
- Some advances on Lovász-Schrijver relaxations of the fractional stable set polytopeElectronic Notes in Discrete Mathematics, 2011
- On the polyhedral lift-and-project methods and the fractional stable set polytopeDiscrete Optimization, 2009
- The strong perfect graph theoremAnnals of Mathematics, 2006
- Recognizing Berge GraphsCombinatorica, 2005
- Tree-width and the Sherali–Adams operatorDiscrete Optimization, 2004
- Progress on perfect graphsMathematical Programming, 2003
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975