Cutting Planes for Mixed 0-1 Semidefinite Programs

Garud Iyengar, M. T. Çezik. Cutting Planes for Mixed 0-1 Semidefinite Programs. In Karen Aardal, Bert Gerards, editors, Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Volume 2081 of Lecture Notes in Computer Science, pages 251-263, Springer, 2001. [doi]

@inproceedings{IyengarC01:0,
  title = {Cutting Planes for Mixed 0-1 Semidefinite Programs},
  author = {Garud Iyengar and M. T. Çezik},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2081/20810251.htm},
  researchr = {https://researchr.org/publication/IyengarC01%3A0},
  cites = {0},
  citedby = {0},
  pages = {251-263},
  booktitle = {Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
  editor = {Karen Aardal and Bert Gerards},
  volume = {2081},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42225-0},
}