Now showing items 1-1 of 1
Variants of the mixed postman problem solvable using linear programming
Variantes del problema del cartero mixto que se pueden resolver usando programación lineal
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 ...