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

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

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric appro

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

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for research