Semidefinite Programming and Integer Programming

Cached

Download Links

by Monique Laurent , Franz Rendl
Citations:48 - 7 self

Active Bibliography

99 Semidefinite Programming and Combinatorial Optimization – Michel X. Goemans - 1998
1 Efficient Approximation Algorithms for Some Semidefinite Programs – Hsueh-i Lu, N. Klein, Franco P. Preparata, Pascal Van Hentenryck - 1996
9 Semidefinite Relaxations for Max-Cut – Monique Laurent - 2001
6 Interior point and semidefinite approaches in combinatorial optimization – Kartik Krishnan, Tamás Terlaky - 2005
85 A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming – M. Laurent - 2001
29 Cuts for mixed 0-1 conic programming – M. T. Cezik, et al. - 2005
1 Finding Dense Subgraphs with Mathematical Programming – Anand Srivastav, Katja Wolf - 1999
164 The Dense k-Subgraph Problem – Uriel Feige, Guy Kortsarz, David Peleg - 1999
New Convex Relaxations for the Maximum Cut . . . – Miguel Nuno Ferreira Fialho dos Anjos - 2001
93 Some Applications of Laplace Eigenvalues of Graphs – Bojan Mohar - 1997
Cutting Planes in Integer Programming And Mixed Integer Programming – Hugues Marchand, Alexander Martin, Er Martin, Robert Weismantel, Laurence Wolsey - 1999
4 On Disjunctive Cuts for Combinatorial Optimization – Adam N. Letchford - 2000
17 Matrix Completion Problems – Monique Laurent - 2001
16 A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems – Eran Halperin, Uri Zwick - 2002
7 Tighter linear and semidefinite relaxations for max-cut based on the LovászSchrijver lift-and-project procedure – Monique Laurent
44 On the optimality of the random hyperplane rounding technique for MAX CUT – Uriel Feige, Gideon Schechtman - 2000
Semidefinite Programming and Approximation Algorithms: Second-Year Project Report – Principal Investigator, Yinyu Ye - 2000
958 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
46 Approximation Algorithms for Maximization Problems arising in Graph Partitioning – Michael Langberg - 1998