摘要: … We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovfisz theta function and its applications to stable sets…
springer.com
chalmers.se 
uab.cat 
sci-hub.se 参考文章(60)
László Lovász, Alexander Schrijver, Matrix cones, projection representations, and stable set polyhedra Polyhedral Combinatorics. pp. 1- 18 ,(1990)
Ferenc Juhász, The asymptotic behaviour of Lovász' theta function for random graphs Combinatorica. ,vol. 2, pp. 153- 155 ,(1982) , 10.1007/BF02579314
Svatopluk Poljak, Zsolt Tuza, Maximum cuts and largest bipartite subgraphs. Combinatorial Optimization. pp. 181- 244 ,(1993)
Robert J. McEliece, The Bounds of Delsarte and Lovász, and Their Applications to Coding Theory Springer Berlin Heidelberg. pp. 107- 178 ,(1979) , 10.1007/978-3-662-39641-4_2
Roger A. Horn, Charles R. Johnson, Matrix Analysis Cambridge University Press. ,(1985) , 10.1017/CBO9780511810817
Bojan Mohar, Svatopluk Poljak, Eigenvalues in Combinatorial Optimization Institute for Mathematics and Its Applications. ,vol. 50, pp. 107- 151 ,(1993) , 10.1007/978-1-4613-8354-3_5
Donald E. Knuth, The Sandwich Theorem Electronic Journal of Combinatorics. ,vol. 1, pp. 1- ,(1994) , 10.37236/1193
A. Frieze, M. Jerrum, Improved approximation algorithms for MAX k-CUT and MAX BISECTION Algorithmica. ,vol. 18, pp. 67- 81 ,(1997) , 10.1007/BF02523688
Florence Jessie MacWilliams, Neil James Alexander Sloane, The Theory of Error-Correcting Codes ,(1977)
Noga Alon, Eigen values and expanders Combinatorica. ,vol. 6, pp. 83- 96 ,(1986) , 10.1007/BF02579166