The Chinese Postman Problem for Mixed Networks

DOI10.1287/mnsc.25.7.643zbMath0423.90048OpenAlexW2121220331MaRDI QIDQ3858019

Edward Minieka

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.7.643

zbMATH Keywords

surveytransportationcombinatorial optimizationChinese postman problemminimum cost flow problemmixed networkstotally directed networkstotally undirected networks

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (23)

Algorithms for the windy postman problem ⋮ Solvable cases of the \(k\)-person Chinese postman problem ⋮ A capacitated general routing problem on mixed networks ⋮ Algorithms for the Chinese postman problem on mixed networks ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ New heuristic algorithms for the windy rural postman problem ⋮ Parameterized complexity of the \(k\)-arc Chinese postman problem ⋮ Routing problems: A bibliography ⋮ A new algorithm for the directed Chinese postman problem ⋮ On the windy postman problem on Eulerian graphs ⋮ Postman problems on series-parallel mixed graphs ⋮ Arc routing problems: A review of the past, present, and future ⋮ Plowing with precedence in polynomial time ⋮ New results on the windy postman problem ⋮ A branch-and-price algorithm for the windy rural postman problem ⋮ A Decade of Capacitated Arc Routing ⋮ Series-parallel graphs are windy postman perfect ⋮ Solution of real-world postman problems ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ On the windy postman problem ⋮ The fleet size and mix problem for capacitated arc routing

This page was built for publication: The Chinese Postman Problem for Mixed Networks