# The Windy Postman Problem on Series-Parallel Graphs

Abstract : The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron $O(G)$ induced by the linear programming relaxation of a well-known integer programming formulation of the problem. We say that $G$ is windy postman perfect if $O(G)$ is integral. There exists a polynomial-time algorithm, based on the ellipsoid method, to solve the windy postman problem for the class of windy postman perfect graphs. Eulerian graphs and trees are windy postman perfect. By considering a family of polyhedra related to $O(G)$, we prove that series-parallel graphs are windy postman perfect, therefore solving a conjecture of [Win1987a].
Keywords :
Document type :
Conference papers
Domain :

Cited literature [3 references]

https://hal.inria.fr/hal-01184352
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, August 14, 2015 - 11:36:55 AM
Last modification on : Monday, March 11, 2019 - 10:12:01 AM
Long-term archiving on: : Sunday, November 15, 2015 - 10:58:24 AM

### File

dmAE0132.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01184352, version 1

### Citation

Francisco Javier Zaragoza Martínez. The Windy Postman Problem on Series-Parallel Graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.161-166. ⟨hal-01184352⟩

Record views