Argonne National Laboratory

Parallel Semidefinite Programming and Combinatorial Optimization

TitleParallel Semidefinite Programming and Combinatorial Optimization
Publication TypeReport
Year of Publication2005
AuthorsBenson, SJ
Date Published09/2005
Other NumbersANL/MCS-P1292-0905
Abstract

The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing.

PDFhttp://www.mcs.anl.gov/papers/P1292.pdf