de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons127717

John,  Maximilian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44737

Karrenbauer,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

John, M., & Karrenbauer, A. (2016). A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases. In R. Cerulli, S. Fujishige, & R. A. Mahjoub (Eds.), Combinatorial Optimization (pp. 414-425). Berlin: Springer. doi:10.1007/978-3-319-45587-7_36.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002B-8417-5
Abstract
There is no abstract available