A note on the Lovasz-Schrijver Semidefinite Programming Relaxation for Binary Integer Programs
Optimization and Control
2012-08-21 v2
Abstract
Binary Integer Programming (BIP) problems are of interest due in part to the difficulty they pose and because of their various applications, including those in graph theory, combinatorial optimization and network optimization. In this note, we explicitly state the Lovasz-Schrijver Semidefinite Programming (SDP) relaxation (in primal-standard form) for a BIP problem, a relaxation that yields a tighter upper-bound than the canonical Linear Programming relaxation.
Cite
@article{arxiv.1208.2263,
title = {A note on the Lovasz-Schrijver Semidefinite Programming Relaxation for Binary Integer Programs},
author = {Pietro Paparella},
journal= {arXiv preprint arXiv:1208.2263},
year = {2012}
}