Heuristics for the stochastic Eulerian tour problem

DOI10.1016/J.EJOR.2009.07.007zbMath1192.90029OpenAlexW2061091622MaRDI QIDQ1043339

Michel Gendreau, Srimathy Mohan, Jean-Marc Rousseau

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.007

zbMATH Keywords

heuristicsstochastic demandarc routingChinese postman problemEulerian tour problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Related Items (2)

Arc routing under uncertainty: introduction and literature review ⋮ An updated annotated bibliography on arc routing problems

Cites Work

• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Improvement Procedures for the Undirected Rural Postman Problem
• Matching, Euler tours and the Chinese postman

This page was built for publication: Heuristics for the stochastic Eulerian tour problem