The periodic rural postman problem with irregular services on mixed graphs
From MaRDI portal
Publication:1734335
DOI10.1016/J.EJOR.2019.01.056zbMath1430.90539OpenAlexW2912548412WikidataQ128449855 ScholiaQ128449855MaRDI QIDQ1734335
Demetrio Laganà, Enrique Benavent, Francesca Vocaturo, Angel Corberán
Publication date: 27 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.056
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (5)
A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ Arc routing under uncertainty: introduction and literature review ⋮ Arc routing problems: A review of the past, present, and future ⋮ A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs ⋮ Approximation algorithms for some minimum postmen cover problems
Cites Work
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A branch-and-cut algorithm for the orienteering arc routing problem
- Modeling and solving the mixed capacitated general routing problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- Arc routing problems with time-dependent service costs
- On the cycle polytope of a binary matroid
- A polyhedral approach to the rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- A branch-and-cut algorithm for the undirected rural postman problem
- The undirected capacitated general routing problem with profits
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Evolutionary algorithms for periodic arc routing problems
- A heuristic for the periodic rural postman problem
- The periodic capacitated arc routing problem with irregular services
- Lower and upper bounds for the mixed capacitated arc routing problem
- Road network monitoring: algorithms and a case study
- A scatter search for the periodic capacitated arc routing problem
- Forty years of periodic vehicle routing
- Min-Max K -vehicles windy rural postman problem
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- Networks and vehicle routing for municipal waste collection
- Arc Routing
- A cutting plane algorithm for the general routing problem
This page was built for publication: The periodic rural postman problem with irregular services on mixed graphs
