Geodesic
The Windy Postman Problem on Series-Parallel Graphs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

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]. 
@article{DMTCS_2005_special_250_a5,
     author = {Mart{\'\i}nez, Francisco Javier Zaragoza},
     title = {The {Windy} {Postman} {Problem} on {Series-Parallel} {Graphs}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3396},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3396/}
}
TY  - JOUR
AU  - Martínez, Francisco Javier Zaragoza
TI  - The Windy Postman Problem on Series-Parallel Graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3396/
DO  - 10.46298/dmtcs.3396
LA  - en
ID  - DMTCS_2005_special_250_a5
ER  - 
%0 Journal Article
%A Martínez, Francisco Javier Zaragoza
%T The Windy Postman Problem on Series-Parallel Graphs
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3396/
%R 10.46298/dmtcs.3396
%G en
%F DMTCS_2005_special_250_a5
Martínez, Francisco Javier Zaragoza. The Windy Postman Problem on Series-Parallel Graphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3396. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3396/

Cité par Sources :