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

John, Maximilian; Karrenbauer, Andreas

doi:10.1007/978-3-319-45587-7_36

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

/persons/resource/persons127717

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

/persons/resource/persons44737

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

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: https://hdl.handle.net/11858/00-001M-0000-002B-8417-5

Abstract

There is no abstract available