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:

Vehicle routing for connected service areas - a versatile approach covering single, hierarchical, and bi-criteria objectives

Stefan Bock
European Journal of Operational Research 313 (3) 905 (2024)
https://doi.org/10.1016/j.ejor.2023.08.051

Frontiers in Operations: Waiting Experience in Open-Shop Service Networks: Improvements via Flow Analytics and Automation

Manlu Chen, Opher Baron, Avishai Mandelbaum, Jianfu Wang, Galit B. Yom-Tov and Nadir Arber
Manufacturing & Service Operations Management (2024)
https://doi.org/10.1287/msom.2022.0590

Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem

Moïse Blanchard, Alexandre Jacquillat and Patrick Jaillet
Mathematics of Operations Research (2023)
https://doi.org/10.1287/moor.2021.0286

Policies for the dynamic traveling maintainer problem with alerts

Paulo da Costa, Peter Verleijsdonk, Simon Voorberg, et al.
European Journal of Operational Research 305 (3) 1141 (2023)
https://doi.org/10.1016/j.ejor.2022.06.044

Waiting Experience in Open-Shop Service Networks: Improvements via Flow Analytics & Automation

Manlu Chen, Opher Baron, Avishai Mandelbaum, Jianfu Wang, Galit Yom-Tov and Nadir Arber
SSRN Electronic Journal (2022)
https://doi.org/10.2139/ssrn.4018744

Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining

Ítalo Santana, Alexandre Plastino and Isabel Rosseti
International Transactions in Operational Research 29 (2) 959 (2022)
https://doi.org/10.1111/itor.12774

Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND

Miroslav Kulich and Libor Přeučil
International Transactions in Operational Research 29 (2) 805 (2022)
https://doi.org/10.1111/itor.12794

A constant-factor approximation for directed latency in quasi-polynomial time

Zachary Friggstad and Chaitanya Swamy
Journal of Computer and System Sciences 126 44 (2022)
https://doi.org/10.1016/j.jcss.2021.12.001

The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem

Mauro Henrique Mulati, Ricardo Fukasawa and Flávio Keidi Miyazawa
Discrete Optimization 45 100710 (2022)
https://doi.org/10.1016/j.disopt.2022.100710

Exact and Approximation Algorithms for the Expanding Search Problem

Ben Hermans, Roel Leus and Jannik Matuschke
INFORMS Journal on Computing 34 (1) 281 (2022)
https://doi.org/10.1287/ijoc.2020.1047

Proceedings of the Sixteenth International Conference on Management Science and Engineering Management – Volume 1

Gozde Onder Uzun, Berna Dengiz, Imdat Kara and Oya Ekin Karasan
Lecture Notes on Data Engineering and Communications Technologies, Proceedings of the Sixteenth International Conference on Management Science and Engineering Management – Volume 1 144 506 (2022)
https://doi.org/10.1007/978-3-031-10388-9_37

An online optimization approach for post-disaster relief distribution with online blocked edges

Vahid Akbari and Davood Shiri
Computers & Operations Research 137 105533 (2022)
https://doi.org/10.1016/j.cor.2021.105533

A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones

M.E. Bruni, S. Khodaparasti and M. Moshref-Javadi
Computers & Operations Research 145 105845 (2022)
https://doi.org/10.1016/j.cor.2022.105845

Intensification-driven local search for the traveling repairman problem with profits

Jintong Ren, Jin-Kao Hao, Feng Wu and Zhang-Hua Fu
Expert Systems with Applications 202 117072 (2022)
https://doi.org/10.1016/j.eswa.2022.117072

A Systematic Framework for Maintenance Scheduling and Routing for Off-Shore Wind Farms by Minimizing Predictive Production Loss

Jianshe Feng, Haoshu Cai, Zongchang Liu, et al.
E3S Web of Conferences 233 01063 (2021)
https://doi.org/10.1051/e3sconf/202123301063

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems

René Sitters
SIAM Journal on Computing 50 (5) 1580 (2021)
https://doi.org/10.1137/19M126918X

Tight Bounds for Online TSP on the Line

Antje Bjelde, Jan Hackfeld, Yann Disser, et al.
ACM Transactions on Algorithms 17 (1) 1 (2021)
https://doi.org/10.1145/3422362

Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios

Stefan Bock
European Journal of Operational Research 283 (3) 863 (2020)
https://doi.org/10.1016/j.ejor.2019.11.058

Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem

Noura Smiti, Mohamed Mahjoub Dhiaf, Bassem Jarboui and Saïd Hanafi
International Transactions in Operational Research 27 (1) 651 (2020)
https://doi.org/10.1111/itor.12513

Approximation algorithms for the a priori traveling repairman

Fatemeh Navidi, Inge Li Gørtz and Viswanath Nagarajan
Operations Research Letters 48 (5) 599 (2020)
https://doi.org/10.1016/j.orl.2020.07.009

Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach

Jun Pei, Nenad Mladenović, Dragan Urošević, Jack Brimberg and Xinbao Liu
Information Sciences 507 108 (2020)
https://doi.org/10.1016/j.ins.2019.08.017

Online minimum latency problem with edge uncertainty

Huili Zhang, Weitian Tong, Guohui Lin and Yinfeng Xu
European Journal of Operational Research 273 (2) 418 (2019)
https://doi.org/10.1016/j.ejor.2018.08.017

A bi-objective study of the minimum latency problem

N. A. Arellano-Arriaga, J. Molina, S. E. Schaeffer, A. M. Álvarez-Socarrás and I. A. Martínez-Salazar
Journal of Heuristics 25 (3) 431 (2019)
https://doi.org/10.1007/s10732-019-09405-0

Combining Traveling Salesman and Traveling Repairman Problems: A multi-objective approach based on multiple scenarios

Stefan Bock and Kathrin Klamroth
Computers & Operations Research 112 104766 (2019)
https://doi.org/10.1016/j.cor.2019.104766

Minimizing the average searching time for an object within a graph

Ron Teller, Moshe Zofi and Moshe Kaspi
Computational Optimization and Applications 74 (2) 517 (2019)
https://doi.org/10.1007/s10589-019-00121-w

Apply the quantum particle swarm optimization for the K-traveling repairman problem

Sirine Jmal, Boukthir Haddar and Habib Chabchoub
Soft Computing 23 (23) 12547 (2019)
https://doi.org/10.1007/s00500-019-03805-x

Multiple searchers searching for a randomly distributed immobile target on a unit network

Songtao Li and Simin Huang
Networks 71 (1) 60 (2018)
https://doi.org/10.1002/net.21793

On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations

John Kleppe, Peter Borm, Ruud Hendrickx and Hans Reijnierse
International Game Theory Review 20 (04) 1850007 (2018)
https://doi.org/10.1142/S021919891850007X

Scheduling last-mile deliveries with truck-based autonomous robots

Nils Boysen, Stefan Schwerdfeger and Felix Weidinger
European Journal of Operational Research 271 (3) 1085 (2018)
https://doi.org/10.1016/j.ejor.2018.05.058

The Chinese Postman Problem with Load-Dependent Costs

Ángel Corberán, Güneş Erdoğan, Gilbert Laporte, Isaac Plana and José M. Sanchis
Transportation Science 52 (2) 370 (2018)
https://doi.org/10.1287/trsc.2017.0774

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)
https://doi.org/10.1057/jors.2015.113

A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem

Ricardo Fukasawa, Qie He and Yongjia Song
Transportation Science 50 (1) 23 (2016)
https://doi.org/10.1287/trsc.2015.0593

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

Mohammad Moshref-Javadi and Seokcheon Lee
Expert Systems with Applications 56 335 (2016)
https://doi.org/10.1016/j.eswa.2016.03.030

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)
https://doi.org/10.1016/j.ejor.2015.02.009

Extended Warranties, Maintenance Service and Lease Contracts

D. N. P. Murthy and Nat Jack
Springer Series in Reliability Engineering, Extended Warranties, Maintenance Service and Lease Contracts 311 (2014)
https://doi.org/10.1007/978-1-4471-6440-1_11

Vehicle routing problems with regular objective functions on a path

Wei Yu and Zhaohui Liu
Naval Research Logistics (NRL) 61 (1) 34 (2014)
https://doi.org/10.1002/nav.21564

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)
https://doi.org/10.1016/j.ejor.2013.09.014

A vehicle routing problem with multiple overlapped batches

Mingzhu Yu and Xiangtong Qi
Transportation Research Part E: Logistics and Transportation Review 61 40 (2014)
https://doi.org/10.1016/j.tre.2013.10.004

Asymmetric Traveling Salesman Path and Directed Latency Problems

Zachary Friggstad, Mohammad R. Salavatipour and Zoya Svitkina
SIAM Journal on Computing 42 (4) 1596 (2013)
https://doi.org/10.1137/100797357

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)
https://doi.org/10.1016/j.cor.2013.01.003

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

Amir Salehipour, Kenneth Sörensen, Peter Goos and Olli Bräysy
4OR 9 (2) 189 (2011)
https://doi.org/10.1007/s10288-011-0153-0

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)
https://doi.org/10.1137/07068151X

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Viswanath Nagarajan and R. Ravi
Lecture Notes in Computer Science, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 5171 193 (2008)
https://doi.org/10.1007/978-3-540-85363-3_16

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)
https://doi.org/10.1016/j.tcs.2008.08.003

Theory and Applications of Models of Computation

Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci and Luigi Laura
Lecture Notes in Computer Science, Theory and Applications of Models of Computation 3959 1 (2006)
https://doi.org/10.1007/11750321_1

Machine scheduling with deliveries to multiple customer locations

Chung-Lun Li, George Vairaktarakis and Chung-Yee Lee
European Journal of Operational Research 164 (1) 39 (2005)
https://doi.org/10.1016/j.ejor.2003.11.022

Computer-Aided Complexity Classification of Dial-a-Ride Problems

Willem E. de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters and Leen Stougie
INFORMS Journal on Computing 16 (2) 120 (2004)
https://doi.org/10.1287/ijoc.1030.0052

Integer Programming and Combinatorial Optimization

René Sitters
Lecture Notes in Computer Science, Integer Programming and Combinatorial Optimization 2337 230 (2002)
https://doi.org/10.1007/3-540-47867-1_17

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 Stougie
Lecture 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-Spaccamela
Lecture Notes in Computer Science, Algorithms and Complexity 1767 1 (2000)
https://doi.org/10.1007/3-540-46521-9_1

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)
https://doi.org/10.1137/S0097539797322255

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)
https://doi.org/10.1016/S0966-8349(98)00060-6

An improved approximation ratio for the minimum latency problem

Michel Goemans and Jon Kleinberg
Mathematical Programming 82 (1-2) 111 (1998)
https://doi.org/10.1007/BF01585867