Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design

Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,

This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leadi