References
- SIAM J. Optimization v.5 no.1 Interior point methods in semidefinite programming with applications to combinatorial optimizations Alizadeh, F.
- Technical Report 659 Primal-dual interior-point methods for semidefinite programming Alizadeh F.;J.P. Haeberly;M. Overton
- Mathematical Programming v.80 Approximating the independence number via the θ-function Alon, N.;N. Kahale
- Research report A strengthened SDP relaxation via a second lifting for the Max-Cut problem Anjos, M.;H. Wolkowicz
- Research report A tight semidefinite relaxation of the cut polytope Anjos, M.;H. Wolkowicz
- Research Report CORR 98-31 Strong duality for a trust-region type relaxation of the quadratic assignment problem Anstreicher, K;X. Chen;H. Wolkowicz;Y. Yuan
- Theory and Algorithms Nonlinear Programming Bazaraa, M.S.;C.M. Shetty
- Technical Report Solving large-scale sparse semidefinite programs for combinatorial optimization Benson, S.;Y. Ye;X. Zhang
- Bulletin of American Mathematical Society v.21 no.1 On a theory of computation and complexity over real numbers: NP-completeness, recursive functions and universal machines Blum, L.;M. Shub;S. Smale
- Proc. of 3rd European Symp. on Algs. v.LNCS979 A geometric approach to betweenness Chor, B.;M. Sudan
- CWI report Relaxations of the satisfiability problem using semidefinite programming de Klerk, E.;H.V. Maaren;J.P. Warners
- J. Res. Nat. Bureau of Standards v.69B Maximum matching and a polyhedron with 0,1-vertices Edmonds, J.
- Proc. of 3rd Israel Symp. on Theory of Computing and systems Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT Feige, U.;M.X. Goemans
- Proc. of 4th Integer Programming and Combinatorial Optimization Conference Improved approximation algorithms for MAX k-CUT and MAX BISECTION Frieze, A.;M. Jerrum
- Computers and Intractability: A guide to the theory of NP-completeness Garey, M.R.;D.S. Johnson
- Mathematical Programming v.79 Semidefinite programming in combinatorial optimization Goemans, M.X.
- Documenta Mathematica v.Extra Volume ICM III Semidefinite programming and combinatorial optimization Goemans, M.X.
- Computing Semidefinite programs and association schemes Goemans, M.X.;F. Rendl
- Proc 26th Annual ACM symposium on Theory of Computing 0.878-approximation algorithms for MAX CUT and MAX-2SAT Goemans, M.X.;D.P. Williamson
- J. ACM v.42 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Goemans, M.X.;D.P. Williamson
- Combinatorica v.1 no.2 The ellipsoid method and its consequences in combinatorial optimization Grotschel, M.;L. Lovasz;A. Schrijver
- Annals of Discrete Mathematics v.21 Polynomial algorithms for perfect graphs Grotschel, M.;L. Lovasz;A. Schrijver
- Geometric Algorithms and Combinatorial Optimization Grotschel, M.;L. Lovasz;S. Schrijver
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes Helmberg, C.;F. Rendl
- SIAM J. Optimi. v.6 An interior-point method for semidefinite programming Helmberg, C.;F. Rendl;R.J. Vanderbei;H. Wolkowicz
- A semidefinite programming approach to the quadratic knapsack problem Helmberg, C.;F. Rendl;R. Weismantel
- Technical Report An improved rounding method and semidefinite programming relaxation for graph partition Han, Q.;Y. Ye;H. Zhang;J. Zhang
- Journal of ACM v.45 Approximate graph coloring by semidefinite programming Karger, D.;R. Motwani;M. Sudan
- Combinatorica v.4 A new polynomial -time algorithm for linear programming Karmarkar, N.
- IEEE Transactions on Information Theory v.25 no.1 On the Shannon capacity of a graph Lovasz, L.
- SIAM J. Optimi. v.1 no.2 Cones of matrices and set-functions and 0-1 optimization Lovasz, L.;A. Schrijver
- Duality results for conic convex programming Luo, Z.Q.;J.F. Sturm;S. Zhang
- Proc. 36th Symp. on Foundations of Computer Science Derandomizing semidefinite programming based approximation algorithms Mahajan, S.;H. Ramesh
- Combinatorial and Graph Thoeretic Problems in Linear Algebra, volume 50 of The IMA Volumes in Mathematics and its Applications Eigenvalue methods in combinatorial optimization Mohar, B.;S. Poljak;Brualdi, R.;S. Friedland;V. Klee(eds)
- SIAM Studies in Applied Mathematics Interiorpoint polynomial algorithms in convex programming Nesterov, Y.;A. Nemirovskii
- Society for Industrial and Applied Mathematics Interior point polynomial methods in convex programming: theory and applications Nesterov, Y.;A. Nemirovskii
- Combinatorial Optimization: Algorithms and Complexity Papadimitriou, C.H.;K. Steiglitz
- Proc. IPCO V, Lec. Note on Computer Sciences 1084 Cone-LP's and semidefinite programs: Geometry and a simplex-type method Pataki, G.
- Department of Combinatorics and Optimization On the generic properties of convex optimization problems in conic form Pataki, G.;L. Tuncel
- SIAM J. Optimization Nonpolyhedral relaxations of graph-bisection problems Poljak, S.;F. Rendl
- DIMACS Tech. An exact duality theory for semidefinite programming and its complexity implications Ramana, M.
- SIAM J. Optimization Strong duality for semidefinite programming Ramana, M.;L. Tuncel;H. Wolkowicz
- SIAM J. Discrete Mathematics A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems Sherali, H.D.;W.P. Adams
- Lagrange Multipliers Revisited: A Contribution to Nonlinear Programming Slater, M.
- Approximation Algorithms for Combinatorial Optimization Finding dense subgraphs with semidefinite programming Srivastav, A.;K. Wolf;Jansen, K.;J. Rolim(eds.)
- SIAM Review Semidefinte programming Vandenberghe, L.;S. Boyd
- Discrete Applied Mathematics v.96/97 Semidefinite relaxations for the graph partitioning problem Wolkowicz, H.;Q. Zhao
- SIAM J. Computing v.19 A class of projective transformations for linear programming Ye, Y.
- Technical Report A .699-approximation algorithm for max-bisection Ye, Y.
- Technical Report Approximation of dense-n/2-subgraph and the complement of min-bisection Ye, Y.;J. Zhang
- Journal of Combinatorial Optimizatoin Semidefinite programming relaxations for the quadratic assignment problem Zhao, Q.;S.E. Karisch;F. Rendle;H. Wolkowicz