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

Rainer Ernst Burkard, Eranda Çela, G. Rote, Gerhard Johannes Wöginger

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Original language	English
Title of host publication	Integer programming and combinatorial optimization
Place of Publication	Berlin
Publisher	Springer
Pages	204-218
Volume	1084
Publication status	Published - 1996

Name	Lecture Notes in Computer Science
Publisher	Springer

Cite this

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases. / Burkard, Rainer Ernst ; Çela, Eranda; Rote, G. et al.
Integer programming and combinatorial optimization. Vol. 1084 Berlin: Springer, 1996. p. 204-218 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

@inbook{d33fc8881f114283bc56a414e1ce327d,

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

author = "Burkard, {Rainer Ernst} and Eranda {\c C}ela and G. Rote and W{\"o}ginger, {Gerhard Johannes}",

year = "1996",

language = "English",

volume = "1084",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "204--218",

booktitle = "Integer programming and combinatorial optimization",

}

TY - CHAP

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

AU - Burkard, Rainer Ernst

AU - Çela, Eranda

AU - Rote, G.

AU - Wöginger, Gerhard Johannes

PY - 1996

Y1 - 1996

M3 - Chapter

VL - 1084

T3 - Lecture Notes in Computer Science

SP - 204

EP - 218

BT - Integer programming and combinatorial optimization

PB - Springer

CY - Berlin

ER -