Semidefinite Programming and Integer Programming

Handbooks in Operations Research and Management Science

Volumn 12, Issue C, 2005, Pages 393-514

  Laurent, Monique ^a   Rendl, Franz ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745858905     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)12008-8     Document Type: Review

References (245)

1. Aguilera N.E., Bianchi S.M., and Nasini G.L. Lift and project relaxations for the matching polytope and related polytopes. Discrete Applied Mathematics 134 (2004) 193-212
2. Aguilera N.E., Escalante M.S., and Nasini G.L. The disjunctive procedure and blocker duality. Discrete Applied Mathematics 121 (2002) 1-13
3. Aguilera N.E., Escalante M.S., and Nasini G.L. A generalization of the perfect graph theorem under the disjunctive index. Mathematics of Operations Research 27 (2002) 460-469
4. Alfakih A. Graph rigidity via Euclidean distance matrices. Linear Algebra and its Applications 310 (2000) 149-165
5. Alfakih A. On rigidity and realizability of weighted graphs. Linear Algebra and its Applications 325 (2001) 57-70
6. Alfakih A., Khandani A., and Wolkowicz H. Solving Euclidean distance matrix completion problems via semidefinite programming. Computational Optimization and Applications 12 (1999) 13-30
7. Alfakih A., and Wolkowicz H. On the embeddability of weighted graphs in Euclidean spaces. Technical Report, CORR 98-12 (1998), Department of Combinatorics and Optimization, University of Waterloo. Available at http://orion.math.uwaterloo.ca/~hwolkowi/
8. Alizadeh F. Interior point methods in semidefinite programming with applications in combinatorial optimization. SIAM Journal on Optimization 5 (1995) 13-51
9. Alon N., and Kahale N. Approximating the independence number via the θ{symbol}-function. Mathematical Programming 80 (1998) 253-264
10. Alon N., and Sudakov B. Bipartite subgraphs and the smallest eigenvalue. Combinatorics, Probability and Compuiting 9 (2000) 1-12
11. Alon N., Sudakov B., and Zwick U. Constructing worst case instances for semidefinite programming based approximation algorithms. SIAM Journal on Discrete Mathematics 15 (2002) 58-72 [Preliminary version in Proceedings of 12 th ACM-SIAM Symposium on Discrete Algorithms, pages 92-100, 2001.]
12. Anjos M.F. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems. PhD thesis (2001), University of Waterloo
13. Anjos M. An improved semidefinite programming relaxation for the satisfiability problem. Mathematical Programming (2004)
14. Anjos M.F., and Wolkowicz H. Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Applied Mathematics 119 (2002) 79-106
15. Anjos M.F., and Wolkowicz H. Geometry of semidefinite Max-Cut relaxations via ranks. Journal of Combinatorial Optimization 6 (2002) 237-270
16. Anstreicher K., and Brixius N. A lower bound for the Quadratic Assignment Problem based on Convex Quadratic Programming. Mathematical Programming 89 (2001) 341-357
17. Anstreicher K., Brixius N., Goux J.-P., and Linderoth J. Solving large quadratic assignment problems on computational grids. Mathematical Programming B 91 (2002) 563-588
18. Anstreicher K., and Wolkowicz H. On Lagrangian relaxation of quadratic matrix constraints. SIAM Journal on Matrix Analysis and its Applications 22 (2000) 41-55
19. Arora S., Bollobás B., and Lovász L. Proving integrality gaps without knowing the linear program. Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (2002), IEEE Computer Science Press, Los Alamitos, CA
20. Arora S., Karger D., and Karpinski M. Polynomial time approximation schemes for dense instances of NP-hard problems. Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995), ACM, New York 284-293
21. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and intractability of approximation problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (1992), IEEE Computer Science Press, Los Alamitos, CA 14-23
22. Asano, T., D. P. Williamson. Improved approximation algorithms for MAX SAT. In Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 96-115.
23. Balas E. Disjunctive programming. Annals of Discrete Mathematics 5 (1979) 3-51
24. Balas E., Ceria S., and Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58 (1993) 295-324
25. Ball M.O., Liu W., and Pulleyblank W.R. Two terminal Steiner tree polyhedra. In: Tulkens B., and Tulkens H. (Eds). Contributions to Operations Research and Economics (1989), MIT Press, Cambridge, MA 251-284
26. Barahona F. On cuts and matchings in planar graphs. Mathematical Programming 60 (1993) 53-68
27. Barahona F. On the computational complexity of Ising spin glass models. Journal of Physics A, Mathematical and General 15 (1982) 3241-3253
28. 5. Operations Research Letters 2 (1983) 107-111
29. Barahona F., and Mahjoub A.R. On the cut polytope. Mathematical Programming 36 (1986) 157-173
30. Barahona F., and Mahjoub A.R. Compositions of graphs and polyhedra. II: stable sets. SIAM Journal on Discrete Mathematics 7 (1994) 359-371
31. Barvinok A.I. Feasibility testing for systems of real quadratic equations. Discrete and Computational Geometry 10 (1993) 1-13
32. Barvinok A.I. Problems of distance geometry and convex properties of quadratic maps. Discrete and Computational Geometry 13 (1995) 189-202
33. Barvinok A.I. A remark on the rank of positive semidefinite matrices subject to affine constraints. Discrete and Computational Geometry 25 (2001) 23-31
34. Basu S., Pollack R., and Roy M.-F. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the Association for Computing Machinery 43 (1996) 1002-1045
35. Bellare M., and Rogaway P. The complexity of approximating a nonlinear program. Mathematical programming 69 (1995) 429-441
36. Berge, C. (1962). Sur une conjecture relative au problème des codes optimaux. Communication, 13ème assemblée générale de 1'URSI, Tokyo
37. Berman P., and Karpinski M. On some tighter inapproximability results, further improvements. Electronic Colloquium on Computational Complexity (1998) Report TR98-065
38. Bienstock D., and Zuckerberg M. Subset algebra lift operators for 0 - 1 integer programming. SIAM Journal on Optimization 15 (2004) 63-95
39. Blum A. New approximation algorithms for graph coloring. Journal of the Association for Computing Machinery 41 (1994) 470-516 [Preliminary version in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, ACM, New York, pages 535-542, 1989 and in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Los Alamitos, CA, pages 554-562, 1990.]
40. 3/14)-coloring algorithm for 3-colorable graphs. Information Processing Letters 61 (1997) 49-53
41. Bochnak J., Coste M., and Roy M.-F. Géométrie Algébrique Réelle (1987), Springer-Verlag
42. Bockmayr A., Eisenbrand F., Hartmann M., and Schulz A.S. On the Chvátal rank of polytopes in the 0/1 cube. Discrete Applied Mathematics 98 (1999) 21-27
43. Bomze I.M., Dür M., de Klerk E., Roos C., Quist A.J., and Terlaky T. On copositive programming and standard quadratic optimization problems. Journal of Global Optimization 18 (2000) 301-320
44. Bomze I.M., and de Klerk E. Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Journal of Global Optimization 24 (2002) 163-185
45. Borwein J.M., and Wolkowicz H. Regularizing the abstract convex program. Journal of Mathematical Analysis and Applications 83 (1981) 495-530
46. Bourgain J. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics 52 (1985) 46-52
47. Caprara A., and Letchford A.N. On the separation of split cuts and related inequalities. Mathematical Programming Series B 94 (2003) 279-294
48. Cela E. The Quadratic Assignment Problem: Theroy and Algorithms (1998), Kluwer Academic Publishers, USA
49. Ceria S. Lift-and-Project Methods for Mixed 0-1 Programs. PhD dissertation (1993), Graduate School of Industrial Administration, Carnegie Mellon University, US
50. Ceria S., and Pataki G. Solving integer and disjunctive programs by lift-and-project. In: Bixby R.E., Boyd E.A., and Rios-Mercato R.Z. (Eds). IPCO VI, Lecture Notes in Computer Science 1412 (1998) 271-283
51. Charikar M. On semidefinite programming relaxations for graph colouring and vertex cover. Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (2002) 616-620
52. Chudnovsky, M., N. Robertson, P. Seymour, R. Thomas (2002). The strong perfect graph theorem. To appear in Annals of Mathematics
53. Chvátal V. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics 4 (1973) 305-337
54. Chvátal V. On certain polytopes associated with graphs. Journal of Combinatorial Theroy B 18 (1975) 138-154
55. Chvátal V., Cook W., and Hartman M. On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications 114/115 (1989) 455-499
56. Cook W., and Dash S. On the matrix-cut rank of polyhedra. Mathematics of Operations Research 26 (2001) 19-30
57. Cook W., Kannan R., and Schrijver A. Chvátal closures for mixed integer programming problems. Mathematical Programming 47 (1990) 155-174
58. Cornuéjols G., and Li Y. Elementary closures for integer programs. Operations Research Letters 28 (2001) 1-8
59. Cornuéjols G., and Li Y. On the rank of mixed 0-1 polyhedra. In: Aardal K., and Gerards A.M.H. (Eds). IPCO 2001, Lecture Notes in Computer Science 2081 (2001) 71-77
60. Cornuéjols G., and Li Y. A connection between cutting plane theory and the geometry of numbers. Mathematical Programming A 93 (2002) 123-127
61. Crippen G.M., and Havel T.F. Distance Geometry and Molecular Conformation (1988), Research Studies Press, Taunton, Somerset, England
62. Cvetković, D., M. Cangalvić, V. Kovačevič-Vujčić (1999). Semidefinite programming methods for the symmetric traveling salesman problem, In Proceedings of the 7th International IPCO Conference, Graz, Austria, pp. 126-136.
63. Dash S. On the Matrix Cuts of Lovász and Schrijver and their Use in Integer Programming. PhD thesis (2001), Rice University
64. Dash S. An exponential lower bound on the length of some classes of branch-and-cut proofs. In: Cook W.J., and Schulz A.S. (Eds). IPCO 2002, Lecture Notes in Computer Science 2337 (2002) 145-160
65. Delorme C., and Poljak S. Laplacian eigenvalues and the maximum cut problem. Mathematical Programming 62 (1993) 557-574
66. Delorme C., and Poljak S. Combinatorial properties and the complexity of a max-cut approximation. European Journal of Combinatorics 14 (1993) 313-333
67. Delorme C., and Poljak S. The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discrete Mathematics 111 (1993) 145-156
68. Delsarte P. An algebraic approach to the association schemes of coding theory. Philips Research Reports Supplements No. 10 (1973)
69. Deza M., and Laurent M. Geometry of Cuts and Metrics (1997), Springer-Verlag
70. Dinur I., and Safra S. The importance of being biased. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (2002), ACM, New York 33-42
71. Duffin R.J. Infinite Programmes. In: Kuhn H.W., and Tucker A.W. (Eds). Linear Inequalities and Related Systems, Annals of Mathematicals, Studies Vol. 38 (1956), Princeton University Press 157-170
72. Eisenblätter, A. (2001). Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD Thesis, TU Berlin, Germany, Available at ftp://ftp.zib.de/pub/zib-publications/books/PhD_eisenblaetter.ps.Z
73. Eisenblätter A. The semidefinite relaxation of the k-partition polytope is strong. In: Cook W.J., and Schulz A.S. (Eds). IPCO 2002, Lecture Notes in Computer Science 2337 (2002) 273-290
74. Eisenbrand F. On the membership problem for the elementary closure of a polyhedron. Combinatorica 19 (1999) 299-300
75. Eisenbrand F., and Schulz A.S. Bounds on the Chvátal rank of polytopes in the 0/1 cube. In: Cornuéjols G., et al. (Ed). IPCO 1999, Lecture Notes in Computer Science 1610 (1999) 137-150
76. Feige U. Randomized graph products, chromatic numbers, and the Lovász θ{symbol}-function. Combinatorica 17 (1997) 79-90 [Preliminary version in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 635-640, 1995.]
77. Feige U. Randomized rounding of semidefinite programs - variations on the MAX CUT example. Randomization, Approximation, and Combinatorial Optimization, Proceedings of Random-Approx'99. Lecture Notes in Computer Science 1671 (1999) 189-196 Springer-Verlag
78. Feige U., and Goemans M. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems (1995), ACM, New York 182-189
79. Feige U., Karpinski M., and Langberg M. Improved approximation of max-cut on graphs of bounded degree. Electronic Colloquium on Computational Complexity (2000) Report TR00-021
80. Feige U., Karpinski M., and Langberg M. A note on approximating max-bisection on regular graphs. Electronic Colloquium on Computational Complexity (2000) Report TR00-043
81. Feige U., and Krauthgamer R. The probable value of the Lovász-Schrijver relaxations for maximum independent set. SIAM Journal on Computing 32 (2003) 345-370
82. Feige U., Langberg M., and Schechtman G. Graphs with tiny vector chromatic numbers and huge chromatic numbers. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (2002), IEEE Computer Science Press, Los Alamitos, CA
83. Feige U., and Schechtman G. On the integrality ratio of semidefinite relaxations of MAX CUT. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001), ACM, New York 433-442
84. Feige U., and Schechtman G. On the optimality of the random hyperplane rounding technique for MAX CUT. Random Structures and Algorithms 20 (2002) 403-440
85. Fiedler M. Bounds for eigenvalues of doubly stochastic matrices. Linear Algebra and its Applications 5 (1972) 299-310
86. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23 (1973) 298-305
87. Frankl P., and Rödl V. Forbidden intersections. Transactions of the American Mathematical Society 300 (1987) 259-286
88. Frieze A., and Jerrum M. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18 (1997) 67-81 [Preliminary version in Proceedings of the 4th International IPCO Conference, Copenhagen, Lecture Notes in Computer Science, 920, 1-13, 1995.]
89. Fujie T., and Kojima M. Semidefinite programming relaxation for nonconvex quadratic programs. Journal of Global Optimization 10 (1997) 367-380
90. Fulkerson D.R. Anti-blocking polyhedra. Journal of Combinatorial Theory B 12 (1972) 50-71
91. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976) 237-267
92. Goemans M.X. Semidefinite programming in combinatorial optimization. Mathematical Programming (1997) 143-161
93. Goemans M., and Rendl F. Semidefinite programs and association schemes. Computing 63 (1999) 331-340
94. Goemans M.X., and Tunçel L. When does the positive semidefiniteness constraint help in lifting procedures?. Mathematics of Operations Research 26 (2001) 796-815
95. Goemans M.X., and Williamson D.P. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7 (1994) 656-666
96. Goemans M.X., and Williamson D.P. Improved approximation algorithms for maximum cuts and satisfiability problems using semidefinite programming. Journal of the Association for Computing Machinery 42 (1995) 1115-1145 [Preliminary version in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 422-431, 1994.]
97. Goemans M.X., and Williamson D.P. Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001), ACM, New York 443-452
98. Grigoriev D., Hirsch E.A., and Pasechnik D.V. Complexity of semi-algebraic proofs. Lecture Notes in Computer Science 2285 (2002) 419-430
99. Grigoriev D., de Klerk E., and Pasechnik D.V. Finding optimum subject to few quadratic constraints in polynomial time. Preprint, Extended abstract (2003). available at http://www.thi.informatik.uni-frankfurt.de/~dima/misc/qp-ea.ps
100. Grone R., Johnson C.R., Sá E.M., and Wolkowicz H. Positive definite completions of partial Hermitian matrices. Linear Algebra and its Applications 58 (1984) 109-124
101. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer-Verlag, Berlin, New York
102. Grötschel M., and Pulleyblank W.R. Weakly bipartite graphs and the max-cut problem. Operations Research Letters 1 (1981) 23-27
103. Gruber G., and Rendl F. Computational experience with stable set relaxations. SIAM Journal on Optimization 13 (2003) 1014-1028
104. Guenin B. A characterization of weakly bipartite graphs. Journal of Combinatorial Theory B 81 (2001) 112-168
105. Hadley S.W., Rendl F., and Wolkowicz H. A new lower bound via projection for the quadratic assignment problem. Mathematics of Operations Research 17 (1992) 727-739
106. Halldórsson M.M. A still better performance guarantee for approximate graph coloring. Information Processing Letters 45 (1993) 19-23
107. Halldórsson M.M. Approximations of independent sets in graphs. In: Jansen K., and Rolim J. (Eds). APPROX '98, Lecture Notes in Computer Science 1444 (1998) 1-14
108. Halldórsson M.M. Approximations of weighted independent sets and hereditary subset problems. In: Asano T., et al. (Ed). COCOON '99, Lecture Notes in Computer Science 1627 (1999) 261-270
109. Halperin E. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM Journal on Computing 31 (2002) 1608-1623 [Preliminary version in Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 329-337, 2000.]
110. Halperin E., Livnat D., and Zwick U. MAX-CUT in cubic graphs. Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (2002) 506-513
111. Halperin E., Nathaniel R., and Zwick U. Coloring k-colorable graphs using relatively small palettes. Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms (2001) 319-326
112. Halperin E., and Zwick U. A unified framework for obtaining improved approximations algorithms for maximum graph bisection problems. In: Aardal K., and Gerards A.M.H. (Eds). IPCO 2001, Lecture Notes in Computer Science 2081 (2001) 210-225
113. Halperin E., and Zwick U. Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs. Journal of Algorithms 40 (2001) 184-211 [Preliminary version in Proceedings of the 7th conference on Integer Programming and Combinatorial Optimization, Graz, Austria, pp. 202-217, 1999.]
114. Halperin E., and Zwick U. Combinatorial approximation algorithms for the maximum directed cut problem. Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms (2001) 1-7
115. Håstad, J. (1997). Some optimal inapproximability results. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, ACM, New York, pp. 1-10. [Full version in Electronic Colloquium on Computational Complexity, Report TR97-037.]
116. Helmberg C., Rendl F., Vanderbei R.J., and Wolkowicz H. An interior-point method for semidefinite programming. SIAM Journal on Optimization 6 (1996) 342-361
117. Helmberg C., Rendl F., and Weismantel R. A semidefinite programming approach to the quadratic knapsack problem. Journal of Combinatorial Optimization 4 (2000) 197-215
118. Hill R.D., and Waters S.R. On the cone of positive semidefinite matrices. Linear Algebra and its Applications 90 (1987) 81-88
119. Hoffman A.J., and Wielandt H.W. The variation of the spectrum of a normal matrix. Duke Mathematical Journal 20 (1953) 37-39
120. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press
121. Jansen K., Karpinski M., and Lingas A. A polynomial time approximation scheme for MAX-BISECTION on planar graphs. Electronic Colloquium on Computational Complexity (2000) Report TR00-064
122. Johnson C.R. Matrix completion problems: a survey. In: Johnson C.R. (Ed). Matrix Theory and Applications, Volume 40 of Proceedings of Symposia in Applied Mathematics (1990), American Mathematical Society, Providence, Rhode Island 171-198
123. Johnson D. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
124. Johnson C.R., Kroschel B., and Wolkowicz H. An interior-point method for approximate positive semidefinite completions. Computational Optimization and Applications 9 (1998) 175-190
125. Kann V., Khanna S., Lagergren J., and Panconesi A. On the hardness of approximating MAX k-CUT and its dual. Chicago Journal of Theoretical Computer Science 2 (1997)
126. Karger D., Motwani R., and Sudan M. Approximate graph colouring by semidefinite programming. Journal of the Association for Computing Machinery 45 (1998) 246-265 [Preliminary version in Proceedings of 35th IEEE Symposium on Foundations of Computer Science, IEEE Computer Science Press, Los Alamitos, CA, pages 2-13, 1994.]
127. Karloff H. How good is the Goemans-Williamson max-cut algorithm?. SIAM Journal on Computing 29 (1999) 336-350
128. Karloff H., and Zwick U. A 7/8-approximation algorithm for MAX 3SAT?. Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (1997), IEEE Computer Science Press, Los Alamitos, CA 406-415
129. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), Plenum Press, New York 85-103
130. Khachiyan L., and Porkolab L. Computing integral points in convex semi-algebraic sets. 38th Annual Symposium on Foundations of Computer Science (1997), IEEE Computer Science Press, Los Alamitos, CA 162-171
131. Khachiyan L., and Porkolab L. Integer optimization on convex semialgebraic sets. Discrete and Computational Geometry 23 (2000) 207-224
132. Khanna S., Linial N., and Safra S. On the hardness of approximating the chromatic number. Combinatorica 20 (2000) 393-415 [Preliminary version in Proceedings of the 2nd Israel Symposium on Theory and Computing Systems, IEEE Computer Society Press, Los Alamos, CA, pp. 250-260, 1993.]
133. Kleinberg J., and Goemans M.X. The Lovász theta function and a semidefinite programming relaxation of vertex cover. SIAM Journal on Discrete Mathematics 11 (1998) 196-204
134. de Klerk E. Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications (2002), Kluwer
135. de Klerk, E., M. Laurent, P. Parrilo (2004). A PTAS for the minimization of polynomials of fixed degree over the simplex. Preprint
136. de Klerk E., and Pasechnik D.V. Approximation of the stability number of a graph via copositive programming. SIAM Journal on Optimization 12 (2002) 875-892
137. de Klerk E., Pasechnik D.V., and Warners J.P. Approximate graph colouring and MAX-k-CUT algorithms based on the theta-function. Journal of Combinatorial Optimization 8 (2004) 267-294
138. de Klerk E., Warners J.P., and van Maaren H. Relaxations of the satisfiability problem using semidefinite programming. Journal of Automated Reasoning 24 (2000) 37-65
139. Knuth D.E. The sandwich theorem. Electronic Journal of Combinatorics 1 (1994) 1-48
140. Kojima M., Shindoh S., and Hara S. Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization 7 (1997) 86-125
141. Kojima M., and Tunçel L. Cones of matrices and successive convex relaxations of nonconvex sets. SIAM Journal on Optimization 10 (2000) 750-778
142. Lasserre J.B. Optimality conditions and LMI relaxations for 0 - 1 programs. Technical Report N. 00099 (2000), LAAS, Toulouse
143. Lasserre J.B. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11 (2001) 796-817
144. Lasserre J.B. An explicit exact SDP relaxation for nonlinear 0 - 1 programs. In: Aardal K., and Gerards A.M.H. (Eds). IPCO 2001, Lecture Notes in Computer Science 2081 (2001) 293-303 [See also: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM Journal on Optimization 12, 756-769, 2002.]
145. Lasserre J.B. Semidefinite programming vs. LP relaxations for polynomial programming. Mathematics of Operations Research 27 (2002) 347-360
146. Laurent M. The real positive semidefinite completion problem for series-parallel graphs. Linear Algebra and its Applications 252 (1997) 347-366
147. Laurent M. A connection between positive semidefinite and Euclidean distance matrix completion problems. Linear Algebra and its Applications 273 (1998) 9-22
148. Laurent, M. (1998b). A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, in: P. Pardalos, H. Wolkowicz (eds.), Topics in Semidefinite and Interior-Point Methods, Vol. 18 of the Fields Institute for Research in Mathematical Science, Communication Series, Providence, Rhode Island, pp. 51-76
149. Laurent M. Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems. SIAM Journal on Matrix Analysis and its Applications 22 (2000) 874-894
150. Laurent M. On the sparsity order of a graph and its deficiency in chordality. Combinatorica 21 (2001) 543-570
151. Laurent M. Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure. SIAM Journal on Optimization 12 (2001) 345-375
152. Laurent M. A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0, 1-programming. Mathematics of Operations Research 28 3 (2003) 470-496
153. Laurent M. Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope. Mathematical of Operations Reaserch 28 4 (2003) 871-883
154. Laurent M. Semidefinite relaxations for Max-Cut. In: Grötschel M. (Ed). The Sharpest Cut: The Impact of Manfred Padberg and his Work, MPS-SIAM Series in Optimization 4 (2004) 291-327
155. Laurent M., and Poljak S. On a positive semidefinite relaxation of the cut polytope. Linear Algebra and its Applications 223/224 (1995) 439-461
156. Laurent M., and Poljak S. On the facial structure of the set of correlation matrices. SIAM Journal on Matrix Analysis and its Applications 17 (1996) 530-547
157. Laurent M., Poljak S., and Rendl F. Connections between semidefinite relaxations of the max-cut and stable set problems. Mathematical Programming 77 (1997) 225-246
158. Lenstra Jr. H.W. Integer programming with a fixed number of variables. Mathematics of Operations Research 8 (1983) 538-548
159. Lewin M., Livnat D., and Zwick U. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Cook W.J., and Schulz A.S. (Eds). IPCO 2002, Lecture Notes in Computer Science 2337 (2002) 67-82
160. Linial N., London E., and Rabinovich Yu. The geometry of graphs and some of its algorithmic consequences. Combinatorica 15 (1995) 215-245
161. Linial N., Magen A., and Naor A. Girth and Euclidean distortion. Geometric and Functional Analysis 12 (2002) 380-394
162. Linial N., and Sachs M.E. On the Euclidean distortion of complete binary trees. Discrete and Computational Geometry 29 (2003) 19-21
163. Lipták L., and Tunçel L. Stable set problem and the lift-and-project ranks of graphs. Mathematical Programming Ser. B 98 (2003) 319-353
164. Liu W. Extended Formulations and Polyhedral Projection. PhD thesis (1988), Department of Combinatorics and Optimization, University of Waterloo, Canada
165. Lovász L. Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics 2 (1972) 253-267
166. Lovász L. On the Shannon capacity of a graph. IEEE Transactions on Information Theory IT-25 (1979) 1-7
167. Lovász L. Stable sets and polynomials. Discrete Mathematics 124 (1994) 137-153
168. Lovász L. Semidefinite programs and combinatorial optimization. In: Reed B.A., and Sales C.L. (Eds). Recent Advances in Algorithms and Combinatorics (2003), CMS Books in Mathematics, Springer 137-194
169. Lovász L., and Schrijver A. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1 (1991) 166-190
170. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993), ACM, New York 286-293
171. Maculan N. The Steiner problem in graphs. Annals of Discrete Mathematics 31 (1987) 185-222
172. Mahajan S., and Ramesh H. Derandomizing semidefinite programming based approximation algorithms. Proceedings of the 36th Symposium on Foundations of Computer Science (1995), IEEE Computer Science Press, Los Alamitos, CA 162-169
173. Matuura S., and Matsui T. 0.863-approximation algorithm for MAX DICUT. In: Goemans M., et al. (Ed). APPROX 2001 and RANDOM 2001, Lecture Notes in Computer Science 2129 (2001) 138-146
174. Matuura S., and Matsui T. 0.935-approximation randomized algorithm for MAX 2SAT and its derandomization. Technical Report METR 2001-03 (2001), University of Tokyo. Available at http://www.keisu.t.u-tokyo.ac.jp/METR.html
175. McEliece R.J., Rodemich E.R., and Rumsey Jr. H.C. The Lovász bound and some generalizations. Journal of Combinatorics and System Sciences 3 (1978) 134-152
176. Meurdesoif, P. (2000). Strenghtening the Lovász θ{symbol}({A figure is presented}) bound for graph colouring. Preprint, [Mathematical Programming, to appear]
177. Mohar B., and Poljak S. Eigenvalues and the max-cut problem. Czechoslovak Mathematical Journal 40 (1990) 343-352
178. Monteiro R.D.C. Primal-dual path-following algorithms for semidefinite programming. SIAM Journal on Optimization 7 (1997) 663-678
179. Motzkin T.S., and Straus E.G. Maxima for graphs and a new proof of a theorem of Túran. Canadian Journal of Mathematics 17 (1965) 533-540
180. Murty K.G., and Kabadi S.N. Some NP-complete problems in quadratic and linear programming. Mathematical Programming 39 (1987) 117-129
181. Nemhauser G., and Wolsey L. Integer and Combinatorial Optimization (1988), John Wiley and Sons, New York
182. Nesterov, Y. (1997). Quality of semidefinite relaxation for nonconvex quadratic optimization. CORE Discussion Paper # 9719, Belgium
183. Nesterov Y. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software 9 (1998) 141-160
184. Nesterov Y. Squared functional systems and optimization problems. In: Frenk J.B.G., Roos C., Terlaky T., and Zhang S. (Eds). High Performance Optimization (2000), Kluwer Academic Publishers 405-440
185. von Neumann J. Some matrix inequalities and metrization of matrix space. Tomsk Univ. Rev. 1 (1937) 286-300, (reprinted in: John von Neumann: Collected works, Vol. 4, A. H. Taub ed., MacMillan, 205-219, 1962.)
186. Nugent C.E., Vollman T.E., and Ruml J. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research 16 (1968) 150-173
187. Overton M.L., and Womersley R.S. On the sum of the largest eigenvalues of a symmetric matrix. SIAM Journal on Matrix Analysis and its Applications 13 (1992) 41-45
188. Topics in semidefinite programming and interior point methods. In: Pardalos P.M., and Wolkowicz H. (Eds). Fields Institute Communications 18 (1998), American Mathematical Society
189. Parrilo P.A. Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Oprimization. PhD thesis (2000), California Institute of Technology
190. Parrilo P.A. Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B 96 (2003) 293-320
191. Parrilo P.A., and Sturmfels B. Minimizing polynomial functions. In: Basu S., and Gonzalez-Vega L. (Eds). Algorithmic and Quantitative Real Algebraic Geometry, DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 60 (2003)
192. Pataki G. Cone-LP's and semidefinite programs: geometry and a simplex-type methods. In: Cunningham W.H., MacCormick S.T., and Queyranne M. (Eds). IPCO 1996, Lecture Notes in Computer Science 1084 (1996) 162-174
193. Pataki G. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Mathematics of Operations Research 23 (1998) 339-358
194. Poljak, S. (1991). Polyhedral and eigenvalue approximations of the max-cut problem, in: Sets, Graphs, and Numbers, Vol. 60 of Colloquia Mathematica Societatis János Bolyai, Budapest, Hungary, pp. 569-581
195. Poljak S., and Rendl F. Nonpolyhedral relaxations of graph-bisection problems. SIAM Journal on Optimization 5 (1995) 467-487
196. Poljak S., and Tuza Z. The expected relative error of the polyhedral approximation of the max-cut problem. Operations Research Letters 16 (1994) 191-198
197. Poljak S., and Tuza Z. Maximum cuts and largest bipartite subgraphs. In: Cook W., Lovász L., and Seymour P. (Eds). Combinatorial Optimization, Vol. 20 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1995), American Mathematical Society, Providence, RI 181-244
198. Porkolab L., and Khachiyan L. On the complexity of semidefinite programs. Journal of Global Optimization 10 (1997) 351-365
199. Powers V., and Reznick B. A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra. Journal of Pure and Applied Algebra 164 (2001) 221-229
200. Powers V., and Wörmann T. An algorithm for sums of squares of real polynomials. Journal of Pure and Applied Algebra 127 (1998) 99-104
201. Putinar M. Positive polynomials on compact semi-algebraic sets. Indiana University Mathematics Journal 42 (1993) 969-984
202. Quist A.J., de Klerk E., Roos T., and Terlaky C. Copositive relaxation for general quadratic programming. Optimization Methods and Software 9 (1998) 185-209
203. Ramana M.V. An exact duality theory for semidefinite programming and its complexity implications. Mathematical Programming 77 (1997) 129-162
204. Ramana M.V., and Goldman A. Some geometric results in semidefinite programming. Journal of Global Optimization 7 (1995) 33-50
205. Ramana M.V., Tunçel L., and Wolkowicz H. Strong duality for semidefinite programming. SIAM Journal on Optimization 7 (1997) 641-662
206. Reed B.A., and Ramirez A.J.L. Perfect Graphs (2001), Wiley
207. Rendl F. Semidefinite programming and combinatorial optimization. Applied Numerical Mathematics 29 (1999) 255-281
208. Renegar J. On the computational complexity and geometry of the first order theory of the reals. Journal of Symbolic Computation 13 3 (1992) 255-352
209. Schrijver A. A comparison of the Delsarte and Lovász bounds. IEEE Transactions on Information Theory IT-25 (1979) 425-429
210. Schrijver A. Theory of Linear and Integer Programming (1986), John Wiley and Sons, New York
211. Schrijver A. A short proof of Guenin's characterization of weakly bipartite graphs. Journal of Combinatorial Theory B 85 (2002) 255-260
212. Schrijver A. Combinatorial Optimization - Polyhedra and Efficiency (2003), Springer-Verlag, Berlin
213. Seymour P.D. The matroids with the max-flow min-cut property. Journal of Combinatorial Theory B 23 (1977) 189-222
214. Sherali H., and Adams W. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3 (1990) 411-430
215. Sherali H., and Adams W. A hierarchy of relaxations and convex hull representations for mixed-integer zero-one programming problems. Discrete Applied Mathematics 52 (1994) 83-106
216. Sherali H., and Adams W. A Reformulation-Linearization Technique (RLT) for Solving Discrete and Continuous Nonconvex Problems (1997), Kluwer
217. Sherali H., and Tuncbilek C.H. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization 2 (1992) 101-112
218. Sherali H.D., and Tuncbilek C.H. Reformulation-linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Operations Research Letters 21 (1997) 1-10
219. Shor N.Z. An approach to obtaining global extremums in polynomial mathematical programming problems. Kibernetika 5 (1987) 102-106
220. Shor N.Z. Class of global minimum bounds of polynomial functions. Cybernetics 6 (1987) 731-734 [Translated from Kibernetika, 6, 9-11, 1987.]
221. Shor N.Z. Nondifferentiable Optimization and Polynomial Problems (1998), Kluwer Academic Publishers
222. Skutella M. Convex quadratic and semidefinite programming relaxations in scheduling. Journal of the Association for Computing Machinery 48 (2001) 206-242
223. Sotirov R. Bundle methods in combinatorial optimization. PhD thesis (2003), University of Klagenfurt
224. Stengle G. A Nullstellensatz and a Positivstellensatz in semialgebraic geometry. Mathematische Annalen 207 (1974) 87-97
225. Stephen T., and Tunçel L. On a representation of the matching polytope via semidefinite liftings. Mathematics of Operations Research 24 (1999) 1-7
226. Szegedy M. A note on the θ{symbol} number of Lovász and the generalized Delsarte bound. Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (1994), IEEE Computer Science Press, Los Alamitos, CA 36-39
227. Todd M.J. A study of search directions directions in primal-dual interior-point methods for semidefinite programming. Optimization Methods and Software 11 (1999) 1-46
228. Todd M.J. Semidefinite programming. Acta Numerica 10 (2001) 515-560
229. Trevisan L., Sorkin G.B., Sudan M., and Williamson D.P. Gadgets, approximation, and linear programming. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (1996), IEEE Computer Science Press, Los Alamitos, CA 617-626
230. Tseng P. Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation. SIAM Journal on Optimization 14 (2003) 268-283
231. Vandenberghe L., and Boyd S. Semidefinite programming. SIAM Review 38 (1996) 49-95
232. de la Vega W.F. MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms 8 (1996) 187-198
233. Warners J.P. Nonlinear Approaches to Satisfiability Problems. PhD thesis (1999), Technical University Eindhoven
234. Wigderson A. Improving the performance guarantee for approximate graph colouring. Journal of the Association for Computing Machinery 30 (1983) 729-735
235. In: Wolkowicz H., Saigal R., and Vandenberghe L. (Eds). Handbook of Semidefinite Programming (2000), Kluwer
236. Yannakakis M. Expressing combinatorial optimization problems by linear programs. Proceedings of the 29th International IEEE Symposium on Foundations of Computer Science (1988), IEEE Computer Science Press, Los Alamitos, CA 223-228
237. Yannakakis M. On the approximation of maximum satisfiability. Journal of Algorithms 17 (1994) 475-502
238. Ye Y. Approximating quadratic programming with bound and quadratic constraints. Mathematical Programming 84 (1999) 219-226
239. Ye Y. A 0.699-approximation algorithm for Max-Bisection. Mathematical Programming 90 (2001) 101-111
240. Zhang Y. On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM Journal on Optimization 8 (1998) 365-386
241. Zhang S. Quadratic minimization and semidefinite relaxation. Mathematical Progamming 87 (2000) 453-465
242. Zhao Q., Karisch S.E., Rendl F., and Wolkowicz H. Semidefinite programming relaxations for the Quadratic Assignment Problem. Journal of Combinatorial Optimization 2 (1998) 71-109
243. Zwick U. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. Proceedings of the 31st Annual ACM Symposium on Theory of Computing (1999), ACM, New York 679-687
244. Zwick U. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. Preprint (2000). Available at http://www.math.tau.ac.il/~zwick/
245. Zwick U. Computer assisted proof of optimal approximability results. Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (2002) 496-505