Article thumbnail
Location of Repository

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

By Bissan Ghaddar, Miguel F. Anjos and Frauke Liers
Publisher: Springer Science and Business Media LLC
Year: 2008
DOI identifier: 10.1007/s10479-008-0481-4
OAI identifier:
Provided by: MUCC (Crossref)
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.