A branch-and-bound algorithm for the time-dependent rural postman problem

DOI10.1016/J.COR.2018.07.016zbMath1458.90604OpenAlexW2885173094WikidataQ129426968 ScholiaQ129426968MaRDI QIDQ1628130

Renata Mansini, Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero

Publication date: 3 December 2018

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

On path ranking in time-dependent graphs ⋮ Arc routing problems: A review of the past, present, and future

Cites Work

• Time-dependent routing problems: a review
• Arc routing problems with time-dependent service costs
• Transforming arc routing into node routing problems
• Vehicle dispatching with time-dependent travel times
• An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times

This page was built for publication: A branch-and-bound algorithm for the time-dependent rural postman problem