Skip to main content
Book Chapter

SDP relaxations for some combinatorial optimization problems

Springer New York LLC, (2012), 795-819
DOI: 10.1007/978-1-4614-0769-0_27
16Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Sotirov, R. (2012). SDP relaxations for some combinatorial optimization problems. In International Series in Operations Research and Management Science (Vol. 166, pp. 795–819). Springer New York LLC. https://doi.org/10.1007/978-1-4614-0769-0_27

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