https://hal.inria.fr/hal-01184352MartÃnez, Francisco Javier ZaragozaFrancisco Javier ZaragozaMartÃnezDepartamento de Sistemas [Azcapotzalco] - Universidad Autonoma Metropolitana-AzcapotzalcoThe Windy Postman Problem on Series-Parallel GraphsHAL CCSD2005windy postman problemseries-parallel graphsintegral polyhedra[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]Episciences Iam, CoordinationStefan Felsner2015-08-14 11:36:552019-03-11 10:12:012015-08-14 16:30:21enConference papershttps://hal.inria.fr/hal-01184352/document10.46298/dmtcs.3396application/pdf1The 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].