John, Maximilian Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Karrenbauer, Andreas Algorithms and Complexity, MPI for Informatics, Max Planck Society;
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.
