Cutting planes for mixed 0-1 semidefinite programs

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Iyengar, G., & Çezik, M. T. (2001). Cutting planes for mixed 0-1 semidefinite programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 251–263). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free