Linearizable special cases of the QAP

E. Çela; V.G. Deineko; G.J. Woeginger

Linearizable special cases of the QAP

E. Çela
, V.G. Deineko
, G.J. Woeginger

Onderzoeksoutput: Boek/rapport › Rapport › Academic

159 Downloads (Pure)

Samenvatting

We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.

Originele taal-2	Engels
Uitgeverij	s.n.
Aantal pagina's	11
Status	Gepubliceerd - 2014

Publicatie series

Naam	arXiv.org
Volume	1409.6510 [math.OC]

Toegang tot document

727226370771232Definitieve gepubliceerde versie, 144 KB

Citeer dit

@book{168cb4c7f0aa4f1997fd7c206ce28f14,

title = "Linearizable special cases of the QAP",

abstract = "We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.",

author = "E. {\c C}ela and V.G. Deineko and G.J. Woeginger",

year = "2014",

language = "English",

series = "arXiv.org",

publisher = "s.n.",

}

TY - BOOK

T1 - Linearizable special cases of the QAP

AU - Çela, E.

AU - Deineko, V.G.

AU - Woeginger, G.J.

PY - 2014

Y1 - 2014

N2 - We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.

AB - We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.

M3 - Report

T3 - arXiv.org

BT - Linearizable special cases of the QAP

PB - s.n.

ER -

Linearizable special cases of the QAP

Samenvatting

Publicatie series

Toegang tot document

Vingerafdruk

Citeer dit