Keywords
postman problem
linear programming
Gráfica mixta
problema de cartero
programación lineal
How to Cite
Abstract
Given a connected mixed graph with costs on its edges and arcs, the mixed postman problem consists of finding a minimum cost closed tour of the mixed graph traversing all of its edges and arcs. It is well-known that this problem is NP-hard. However, under certain conditions, the problem can be solved in polynomial time using linear programming, in other words, the corresponding polyhedra are integral. Some of these conditions are: the mixed graph is series parallel or the mixed graph is even. Also, we show that if we add the constraint that each edge is traversed exactly once then the problem can be solved in polynomial time if the set of arcs forms a forest.
References
Guan, M.G. (1960) “Graphic programming using odd or even points”, Chinese Math. 1: 273–277.
Edmonds, J.; Johnson, E.L. (1973) “Matching, Euler tours and the Chinese postman”, Math. Programming 5: 88–124.
Papadimitriou, C.H. (1976) “On the complexity of edge traversing”, J. ACM 23: 544–554.
Duffin, R.J. (1965) “Topology of series-parallel networks”, Journal of Mathematical Analysis and Applications 10: 303–318.
Kappauf, C.H.; Koehler, G.J. (1979) “The mixed postman problem”, Discrete Appl. Math. 1: 89–103.
Christofides, N.; Benavent, E.; Campos, V.; Corberán, Á.; Mota, E. (1984) “An optimal method for the mixed postman problem”, in: P. Thoft-Christensen (Ed.) Lecture Notes in Control and Inform. Sci. 59 Springer, Berlin: 641–649.
Grötschel, M.; Win, Z. (1992) “A cutting plane algorithm for the windy postman problem”, Math. Programming 55: 339–358.
Ralphs, T.K. (1993) “On the mixed Chinese postman problem”, Oper. Res. Lett. 14: 123–127.
Veblen, O. (1912/1913) “An application of modular equations in analysis situs”, Ann. of Math. 2: 86–94.
Ford, L.R., Jr.; Fulkerson, D.R. (1962) Flows in Networks. Princeton University Press, Princeton, N.J.
Zaragoza Martínez, F.J. (2005) “Linear programming relaxations of the mixed postman problem”, Morfismos 9: 21–34.
Win, Z. (1989) “On the windy postman problem on Eulerian graphs”, Math. Programming 44: 97–112.
Grötschel, M.; Lovász, L.; Schrijver, A. (1981) “The ellipsoid method and its consequences in combinatorial optimization”, Combinatorica 1: 169–197.
Zaragoza Martínez, F. J. (2008) “Series-parallel graphs are windy postman perfect”, Discrete Mathematics 308: 1366–1374.
Fernandes, C.G.; Lee, O.; Wakabayashi, Y. (2009) “Minimum cycle cover and chinese postman problems on mixed graphs with bounded tree-width”, Discrete Applied Mathematics 157: 272 – 279.
Tohyama, H.; Adachi, A. (1996) “Complexity of a restricted Chinese postman problem”, Trans. Inform. Process. Soc. Japan 37: 1886–1896.
Zaragoza Mart́ınez, F.J. (2003) Postman Problems on Mixed Graphs. Ph.D. Thesis, University of Waterloo, Waterloo, On.
Khachiyan, L.G. (1979) “A polynomial algorithm in linear programming”, Dokl. Akad. Nauk SSSR 244: 1093–1096.
Comments
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright (c) 2012 Revista de Matemática: Teoría y Aplicaciones