The complexity of the travelling repairman problem
RAIRO-Theor. Inf. Appl., 20 1 (1986) 79-87
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Integer Programming and Combinatorial Optimization
Clifford Stein and David P. Wagner*Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization 2081 406 (2001)
https://doi.org/10.1007/3-540-45535-3_32
Mathematical Foundations of Computer Science 2001
Sven O. Krumke, Willem E. de Paepe, Diana Poensgen and Leen StougieLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2001 2136 487 (2001)
https://doi.org/10.1007/3-540-44683-4_43
Algorithms and Complexity
Giorgio Ausiello, Stefano Leonardi and Alberto Marchetti-SpaccamelaLecture Notes in Computer Science, Algorithms and Complexity 1767 1 (2000)
https://doi.org/10.1007/3-540-46521-9_1
Polynomial time algorithms for some minimum latency problems
Bang Ye WuInformation Processing Letters 75 (5) 225 (2000)
https://doi.org/10.1016/S0020-0190(00)00102-2
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications
Xin He and Zhi-Zhong ChenSIAM Journal on Computing 29 (1) 65 (1999)
https://doi.org/10.1137/S0097539797322255
688 (1999)
https://doi.org/10.1145/301250.301432
An improved approximation ratio for the minimum latency problem
Michel Goemans and Jon KleinbergMathematical Programming 82 (1-2) 111 (1998)
https://doi.org/10.1007/BF01585867
Operations Research in Transportation Systems
Alexander S. BelenkyApplied Optimization, Operations Research in Transportation Systems 20 91 (1998)
https://doi.org/10.1007/978-1-4757-6075-0_3
171 (1998)
https://doi.org/10.1109/HIPC.1998.737986
A branch-and-bound algorithm for the supply connected location-allocation problem on networks
Gülcan N. Yeşilkökçen and George O. WesolowskyLocation Science 6 (1-4) 395 (1998)
https://doi.org/10.1016/S0966-8349(98)00060-6
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
Cliff Stein and Joel WeinOperations Research Letters 21 (3) 115 (1997)
https://doi.org/10.1016/S0167-6377(97)00025-4
Automata, Languages and Programming
Elias Koutsoupias, Christos Papadimitriou and Mihalis YannakakisLecture Notes in Computer Science, Automata, Languages and Programming 1099 280 (1996)
https://doi.org/10.1007/3-540-61440-0_135
Routing problems: A bibliography
Gilbert Laporte and Ibrahim H. OsmanAnnals of Operations Research 61 (1) 227 (1995)
https://doi.org/10.1007/BF02098290
Network Routing
Jacques Desrosiers, Yvan Dumas, Marius M. Solomon and François SoumisHandbooks in Operations Research and Management Science, Network Routing 8 35 (1995)
https://doi.org/10.1016/S0927-0507(05)80106-9
Sales‐delivery man problems on treelike networks
Igor Averbakh and Oded BermanNetworks 25 (2) 45 (1995)
https://doi.org/10.1002/net.3230250204
Special cases of traveling salesman and repairman problems with time windows
John N. TsitsiklisNetworks 22 (3) 263 (1992)
https://doi.org/10.1002/net.3230220305
Time‐dependent traveling salesman problem–the deliveryman case
Abilio LucenaNetworks 20 (6) 753 (1990)
https://doi.org/10.1002/net.3230200605