The k-traveling repairman problem (original) (raw)
Related papers
The multi-depot k-traveling repairman problem
Optimization Letters, 2022
Approximation Algorithms for the A Priori TravelingRepairman
2019
On-line algorithms for the dynamic traveling repair problem
2004
The Dynamic Traveling Repair Problem: Examination of an Asymptotically Optimal Algorithm
2001
Memetic algorithm for the multiple traveling repairman problem with profits
Engineering Applications of Artificial Intelligence, 2019
A heuristic Approach for the k -Traveling Repairman Problem with Profits under Uncertainty
Electronic Notes in Discrete Mathematics, 2018
Heuristics for the traveling repairman problem with profits
Computers & Operations Research, 2013
Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem
2007
Approximating Node Connectivity Problems via Set Covers
Algorithmica, 2003
Special cases of traveling salesman and repairman problems with time windows
Networks, 1992
The dynamic traveling repairman problem
1989
Approximating minimum cost connectivity problems
2000
Approximating k-hop minimum-spanning trees
Operations Research Letters, 2005
A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges
ArXiv, 2019
Nearly linear time minimum spanning tree maintenance for transient node failures
2004
Approximating the Generalized Capacitated Tree-Routing Problem
Lecture Notes in Computer Science, 2008
An approximation algorithm for the k -fixed depots problem
Computers & Industrial Engineering, 2017
Maintaining a minimum spanning tree under transient node failures
2000
A Variation of Minimum Latency Problem
2010
Degree-Constrained k -Minimum Spanning Tree Problem
Complex., 2020
Maurício Souza, Christophe Duhamel
Networks, 2012
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
Algorithmica, 1996
Folk solution for simple minimum cost spanning tree problems
Operations Research Letters, 2016
Approximating minimum spanning tree of depth 2
International Transactions in Operational Research, 1999
Iterative Patching and the Asymmetric Traveling Salesman Problem
2004
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms, 2010
Stability of dynamic traveling repairman problem under Polling-Sequencing policies
2013 European Control Conference (ECC), 2013
Tree-Approximations for the Weighted Cost-Distance Problem
Lecture Notes in Computer Science, 2001
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
1997
Approximating the metric 2-Peripatetic Salesman Problem
Roberto Calvo, Vangelis Paschos
Algorithmic Operations Research, 2010
The (K,k)-capacitated spanning tree problem
Discrete Optimization, 2012
Optimal algorithms for the vertex updating problem of a minimum spanning tree
Parallel Processing Symposium, 1992