A branch-and-bound algorithm for the time-dependent rural postman problem
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for the time-dependent rural postman problem
zbMATH Open document ID: 1458.90604
author: Tobia Calogiuri
author: Gianpaolo Ghiani
author: Emanuela Guerriero
author: Renata Mansini
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6988151
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.016
OpenAlex ID: W2885173094
cites work: Time-dependent routing problems: a review
cites work: Vehicle dispatching with time-dependent travel times
cites work: Transforming arc routing into node routing problems
cites work: Arc routing problems with time-dependent service costs
cites work: An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
Wikidata QID: Q129426968
DOI: 10.1016/J.COR.2018.07.016
description: scientific article; zbMATH DE number 6988151