Polynomial approximation algorithms for the TSP and QAP with a factorial domination number

Research output: Contribution to journal › Article › peer-review

87 Downloads (Pure)

Original language	English
Pages (from-to)	107-116
Journal	Discrete Applied Mathematics
Volume	119
Issue number	1-2
DOIs	https://doi.org/10.1016/S0166-218X(01)00267-0
Publication status	Published - 2002

Keywords

@article{37c8eedf363c4b8db83a8793a5dd26dc,

title = "Polynomial approximation algorithms for the TSP and QAP with a factorial domination number",

keywords = "Travelling salesman problem, Quadratic assignment problem, Approximation algorithm",

author = "Gregory Gutin and Anders Yeo",

year = "2002",

doi = "10.1016/S0166-218X(01)00267-0",

language = "English",

volume = "119",

pages = "107--116",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Polynomial approximation algorithms for the TSP and QAP with a factorial domination number

AU - Gutin, Gregory

AU - Yeo, Anders

PY - 2002

Y1 - 2002

KW - Travelling salesman problem

KW - Quadratic assignment problem

KW - Approximation algorithm

U2 - 10.1016/S0166-218X(01)00267-0

DO - 10.1016/S0166-218X(01)00267-0

M3 - Article

SN - 0166-218X

VL - 119

SP - 107

EP - 116

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -