Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X. Goemans, David P. Williamson · Journal of the ACM · 1995 · 3.6K citations · Full text

On the Shannon capacity of a graph

László Lovász · IEEE Transactions on Information Theory · 1979 · 1.6K citations

Network Theory (Electrical Engineering), Engineering, Network Analysis +23

The Traveling-Salesman Problem and Minimum Spanning Trees

Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +18

Cones of Matrices and Set-Functions and 0–1 Optimization

László Lovász, Alexander Schrijver · SIAM Journal on Optimization · 1991 · 1K citations

Mathematical Programming, Engineering, Planar Graph +17

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

Farid Alizadeh · SIAM Journal on Optimization · 1995 · 893 citations

Mathematical Programming, Numerical Analysis, Engineering +17