Semidefinite programming and integer programming

Abstract

We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems

    Similar works