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):

The customer-centric, multi-commodity vehicle routing problem with split delivery

Mohammad Moshref-Javadi and Seokcheon Lee
Expert Systems with Applications 56 335 (2016)
DOI: 10.1016/j.eswa.2016.03.030
See this article

A vehicle routing problem with multiple overlapped batches

Mingzhu Yu and Xiangtong Qi
Transportation Research Part E: Logistics and Transportation Review 61 40 (2014)
DOI: 10.1016/j.tre.2013.10.004
See this article

Vehicle routing problems on a line-shaped network with release time constraints

Wei Yu and Zhaohui Liu
Operations Research Letters 37 (2) 85 (2009)
DOI: 10.1016/j.orl.2008.10.006
See this article

Approximation Schemes for Minimum Latency Problems

Sanjeev Arora and George Karakostas
SIAM Journal on Computing 32 (5) 1317 (2003)
DOI: 10.1137/S0097539701399654
See this article

Polynomial time algorithms for some minimum latency problems

Bang Ye Wu
Information Processing Letters 75 (5) 225 (2000)
DOI: 10.1016/S0020-0190(00)00102-2
See this article

A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem

Samuel Nucamendi-Guillén, Iris Martínez-Salazar, Francisco Angel-Bello and J Marcos Moreno-Vega
Journal of the Operational Research Society 67 (8) 1121 (2016)
DOI: 10.1057/jors.2015.113
See this article

Solving the traveling repairman problem on a line with general processing times and deadlines

Stefan Bock
European Journal of Operational Research 244 (3) 690 (2015)
DOI: 10.1016/j.ejor.2015.02.009
See this article

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

Zhixing Luo, Hu Qin and Andrew Lim
European Journal of Operational Research 234 (1) 49 (2014)
DOI: 10.1016/j.ejor.2013.09.014
See this article

Exact algorithms for the minimum latency problem

Bang Ye Wu, Zheng-Nan Huang and Fu-Jie Zhan
Information Processing Letters 92 (6) 303 (2004)
DOI: 10.1016/j.ipl.2004.09.009
See this article

Sequence-dependent scheduling with order deliveries

B.M.T. Lin, P.Y. Yin and Y.S. Liu
Applied Mathematics and Computation 222 58 (2013)
DOI: 10.1016/j.amc.2013.06.087
See this article

On the power of lookahead in on-line server routing problems

Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci and Luigi Laura
Theoretical Computer Science 408 (2-3) 116 (2008)
DOI: 10.1016/j.tcs.2008.08.003
See this article

Complexity of decision-theoretic troubleshooting

Marta Vomlelová
International Journal of Intelligent Systems 18 (2) 267 (2003)
DOI: 10.1002/int.10087
See this article

A Faster, Better Approximation Algorithm for the Minimum Latency Problem

Aaron Archer, Asaf Levin and David P. Williamson
SIAM Journal on Computing 37 (5) 1472 (2008)
DOI: 10.1137/07068151X
See this article

A new formulation for the Traveling Deliveryman Problem

Isabel Méndez-Díaz, Paula Zabala and Abilio Lucena
Discrete Applied Mathematics 156 (17) 3223 (2008)
DOI: 10.1016/j.dam.2008.05.009
See this article

Vehicle routing problems with regular objective functions on a path

Wei Yu and Zhaohui Liu
Naval Research Logistics (NRL) 61 (1) 34 (2014)
DOI: 10.1002/nav.21564
See this article

Profit-based latency problems on the line

Sofie Coene and Frits C.R. Spieksma
Operations Research Letters 36 (3) 333 (2008)
DOI: 10.1016/j.orl.2007.11.001
See this article

Smart Cities

Nancy A. Arellano-Arriaga, Ada M. Álvarez-Socarrás and Iris A. Martínez-Salazar
Lecture Notes in Computer Science, Smart Cities 10268 11 (2017)
DOI: 10.1007/978-3-319-59513-9_2
See this article

Open problems around exact algorithms

Gerhard J. Woeginger
Discrete Applied Mathematics 156 (3) 397 (2008)
DOI: 10.1016/j.dam.2007.03.023
See this article

Asymmetric Traveling Salesman Path and Directed Latency Problems

Zachary Friggstad, Mohammad R. Salavatipour and Zoya Svitkina
SIAM Journal on Computing 42 (4) 1596 (2013)
DOI: 10.1137/100797357
See this article

Emergency path restoration problems

Igor Averbakh
Discrete Optimization 9 (1) 58 (2012)
DOI: 10.1016/j.disopt.2012.01.001
See this article

An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications

Xin He and Zhi-Zhong Chen
SIAM Journal on Computing 29 (1) 65 (1999)
DOI: 10.1137/S0097539797322255
See this article

Physical search problems with probabilistic knowledge

Noam Hazon, Yonatan Aumann, Sarit Kraus and David Sarne
Artificial Intelligence 196 26 (2013)
DOI: 10.1016/j.artint.2012.12.003
See this article

Network Routing

Jacques Desrosiers, Yvan Dumas, Marius M. Solomon and François Soumis
Handbooks in Operations Research and Management Science, Network Routing 8 35 (1995)
DOI: 10.1016/S0927-0507(05)80106-9
See this article

A note on the traveling repairman problem

Alfredo García, Pedro Jodrá and Javier Tejel
Networks 40 (1) 27 (2002)
DOI: 10.1002/net.10031
See this article

The role of centrality in ambulance dispatching

Seokcheon Lee
Decision Support Systems 54 (1) 282 (2012)
DOI: 10.1016/j.dss.2012.05.036
See this article

A branch-and-bound algorithm for the supply connected location-allocation problem on networks

Gülcan N. Yeşilkökçen and George O. Wesolowsky
Location Science 6 (1-4) 395 (1998)
DOI: 10.1016/S0966-8349(98)00060-6
See this article

Heuristics for the traveling repairman problem with profits

T. Dewilde, D. Cattrysse, S. Coene, F.C.R. Spieksma and P. Vansteenwegen
Computers & Operations Research 40 (7) 1700 (2013)
DOI: 10.1016/j.cor.2013.01.003
See this article

Computing and Combinatorics

Axel Simroth and Alexander Souza
Lecture Notes in Computer Science, Computing and Combinatorics 5609 168 (2009)
DOI: 10.1007/978-3-642-02882-3_18
See this article

On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Cliff Stein and Joel Wein
Operations Research Letters 21 (3) 115 (1997)
DOI: 10.1016/S0167-6377(97)00025-4
See this article

News from the online traveling repairman

Sven O. Krumke, Willem E. de Paepe, Diana Poensgen and Leen Stougie
Theoretical Computer Science 295 (1-3) 279 (2003)
DOI: 10.1016/S0304-3975(02)00409-7
See this article

Finding optimal tour schedules on transportation paths under extended time window constraints

Stefan Bock
Journal of Scheduling 19 (5) 527 (2016)
DOI: 10.1007/s10951-016-0481-1
See this article