Semidefinite programming in combinatorial optimization
- 1 October 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 79 (1-3) , 143-161
- https://doi.org/10.1007/bf02614315
Abstract
No abstract availableAll Related Versions
This publication has 43 references indexed in Scilit:
- Eigenvalue optimizationActa Numerica, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Combinatorial Properties and the Complexity of a Max-cut ApproximationEuropean Journal of Combinatorics, 1993
- A problem that is easier to solve on the unit-cost algebraic RAMJournal of Complexity, 1992
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- A comparison of the Delsarte and Lovász boundsIEEE Transactions on Information Theory, 1979
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956