Abstract
Semidefinite programs have recently turned out to be a powerful tool for approximating integer problems. To survey the development in this area over the last few years, the following topics are addressed in some detail. First, we investigate ways to derive semidefinite programs from discrete optimization problems. The duality theory for semidefinite programs is the key to understand algorithms to solve them. The relevant duality results are therefore summarized. The second part of the paper deals with the approximation of integer problems both in a theoretical setting, and from a computational point of view.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.