SciELO - Scientific Electronic Library Online

vol.19 issue2New geometrical compactness measures for zones designApplication of a cognitive model of emotional appraisal to the board evaluation function of a program that plays chess author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Revista de Matemática Teoría y Aplicaciones

Print version ISSN 1409-2433


ZARAGOZA MARTINEZ, Francisco Javier  and  LOPEZ BRACHO, Rafael. Variants of the mixed postman problem solvable using linear programming. Rev. Mat [online]. 2012, vol.19, n.2, pp.201-210. ISSN 1409-2433.

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 NPhard. 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.

Keywords : Mixed graph; postman problem; linear programming.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License