A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem

Bissan Ghaddar, Miguel F. Anjos and Liers Frauke

Article (2011)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
PolyPublie URL:	https://publications.polymtl.ca/16849/
Journal Title:	Annals of Operations Research (vol. 188, no. 1)
Publisher:	Springer
DOI:	10.1007/s10479-008-0481-4
Official URL:	https://doi.org/10.1007/s10479-008-0481-4
Date Deposited:	18 Apr 2023 15:12
Last Modified:	08 Apr 2025 01:44

Cite in APA 7:	Ghaddar, B., Anjos, M. F., & Frauke, L. (2011). A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Annals of Operations Research, 188(1), 155-174. https://doi.org/10.1007/s10479-008-0481-4
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only