The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases.

Research output: Chapter in Book/Report/Conference proceedingChapter

Original languageEnglish
Title of host publicationInteger programming and combinatorial optimization
Place of PublicationBerlin
PublisherSpringer
Pages204-218
Volume1084
Publication statusPublished - 1996

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Cite this

Burkard, R. E., Dragoti-Cela, E., Rote, G., & Wöginger, G. J. (1996). The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases. In Integer programming and combinatorial optimization (Vol. 1084, pp. 204-218). (Lecture Notes in Computer Science). Berlin: Springer.