Variants of the mixed postman problem solvable using linear programming

DOI10.15517/RMTA.V19I2.1334MaRDI QIDQ5248773zbMATH OpenOpenAlexFDO

Authors F. J. Zaragoza Martínez, Rafael López Bracho

Publication date 8 May 2015

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15517/rmta.v19i2.1334

zbMATH Keywords

linear programmingmixed graphpostman problem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3871059
• scientific article; zbMATH DE number 1187150
• Publication:4944300
• Feasibility of the Mixed Postman Problem with Restrictions on the Edges
• An optimal algorithm for the mixed Chinese postman problem
• Approximation algorithms for a mixed postman problem with restrictions on the arcs
• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• A polyhedral approach to the rural postman problem
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• The time-dependent rural postman problem: polyhedral results

Cited in

(2)

• Postman problems on series-parallel mixed graphs
• Feasibility of the Mixed Postman Problem with Restrictions on the Edges

This page was built for publication: Variants of the mixed postman problem solvable using linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248773)