Now showing items 8-8 of 8

    • Variants of the mixed postman problem solvable using linear programming 

      Zaragoza Martínez, Francisco Javier; López Bracho, Rafael (2012-07-01)
      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 ...