The multi-stripe travelling salesman problem

Autor:	Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela
Předmět:	FOS: Computer and information sciences 90C27 Mathematical optimization Combinatorial optimization Travelling salesman problem Computational complexity theory Discrete Mathematics (cs.DM) Quadratic assignment problem Lin–Kernighan heuristic General Decision Sciences 0102 computer and information sciences 02 engineering and technology Management Science and Operations Research 01 natural sciences Kalmanson conditions 0202 electrical engineering electronic engineering information engineering FOS: Mathematics Mathematics - Combinatorics Special case Mathematics - Optimization and Control Mathematics Discrete mathematics Original Paper Computational complexity 010201 computation theory & mathematics Optimization and Control (math.OC) Theory of computation 020201 artificial intelligence & image processing Tractable special case Combinatorics (math.CO) ddc:004 Distance matrices in phylogeny Computer Science - Discrete Mathematics
Zdroj:	TU Graz Annals of Operations Research Annals of operations research 259(1/2), 21-34 (2017). doi:10.1007/s10479-017-2513-4
ISSN:	0254-5330
DOI:	10.1007/s10479-017-2513-4
Popis:	Annals of operations research 259(1/2), 21-34 (2017). doi:10.1007/s10479-017-2513-4 Published by Springer Science + Business Media B.V, Dordrecht [u.a.]
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63ce7583be24ed2c0de9259cbf8a4d97 https://graz.pure.elsevier.com/en/publications/the-multistripe-travelling-salesman-problem(bd3d9c81-c830-4f10-9ee8-014897c86885).html Zobrazit plný text záznamu