Variants of the mixed postman problem solvable using linear programming

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

Full description

Main Authors: Zaragoza Martínez, Francisco Javier, López Bracho, Rafael
Format: artículo científico
Language: Inglés
Published: 2015
Online Access: http://revistas.ucr.ac.cr/index.php/matematica/article/view/1334
http://hdl.handle.net/10669/13018

Similar Items