The windy postman problem on series-parallel graphs

MaRDI QIDQ3576681zbMATH OpenFDO

Authors F. J. Zaragoza Martínez

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0132/0.html

zbMATH Keywords

integral polyhedraseries-parallel graphswindy postman problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• Series-parallel graphs are windy postman perfect
• On the windy postman problem on Eulerian graphs
• On the windy postman problem
• A cutting plane algorithm for the windy postman problem
• Algorithms for the windy postman problem

Cited in

(8)

• On the windy postman problem on Eulerian graphs
• A cutting plane algorithm for the windy postman problem
• Postman problems on series-parallel mixed graphs
• Series-parallel graphs are windy postman perfect
• Recent results on arc routing problems: an annotated bibliography
• Feasibility of the Mixed Postman Problem with Restrictions on the Edges
• scientific article; zbMATH DE number 4185647 (Why is no real title available?)
• On the windy postman problem

This page was built for publication: The windy postman problem on series-parallel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576681)