Mind the gap: a study of tube tour

DOI10.1016/J.COR.2012.02.001zbMath1251.90315DBLPjournals/cor/DrozdowskiKMMP12OpenAlexW2014192444WikidataQ56212614 ScholiaQ56212614MaRDI QIDQ1761218

Xianqiang Yang

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.001

zbMATH Keywords

heuristicsalgorithm analysisgraph cyclesurban railway

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Paths and cycles (05C38)

Related Items (1)

Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the Geometric Covering Salesman Problem
• The Covering Salesman Problem

This page was built for publication: Mind the gap: a study of tube tour