The periodic rural postman problem with irregular services on mixed graphs
type: Item
instance of: scholarly article
title: The periodic rural postman problem with irregular services on mixed graphs
zbMATH Open document ID: 1430.90539
author: Enrique Benavent
author: Demetrio Laganà
author: Francesca Vocaturo
author: Ángel Corberán
published in: European Journal of Operational Research
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7043167
zbMATH Keywords: routing
zbMATH Keywords: periodic arc routing problem
zbMATH Keywords: mixed rural postman problem
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.01.056
OpenAlex ID: W2912548412
cites work: The undirected capacitated general routing problem with profits
cites work: A branch-and-cut algorithm for the orienteering arc routing problem
cites work: On the cycle polytope of a binary matroid
cites work: The capacitated arc routing problem: Valid inequalities and facets
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: Networks and vehicle routing for municipal waste collection
cites work: Min-Max K -vehicles windy rural postman problem
cites work: New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
cites work: Modeling and solving the mixed capacitated general routing problem
cites work: Forty years of periodic vehicle routing
cites work: A scatter search for the periodic capacitated arc routing problem
cites work: Branch-price-and-cut for the mixed capacitated general routing problem with time windows
cites work: Arc Routing
cites work: A cutting plane algorithm for the general routing problem
cites work: A branch-and-cut algorithm for the maximum benefit Chinese postman problem
cites work: A polyhedral approach to the rural postman problem
cites work: A branch-and-cut algorithm for the undirected rural postman problem
cites work: A heuristic for the periodic rural postman problem
cites work: Two-phase branch-and-cut for the mixed capacitated general routing problem
cites work: Evolutionary algorithms for periodic arc routing problems
cites work: Road network monitoring: algorithms and a case study
cites work: The periodic capacitated arc routing problem with irregular services
cites work: Arc routing problems with time-dependent service costs
Wikidata QID: Q128449855
DOI: 10.1016/J.EJOR.2019.01.056
description: scientific article; zbMATH DE number 7043167