The mixed postman problem

DOI10.1016/0166-218X(79)90016-7MaRDI QIDQ754753zbMATH OpenFDO

Authors Charles H. Kappauf, Gary J. Koehler

Publication date 1979

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(79)90016-7

zbMATH Keywords

connected networkdirected chinese postman probleminteger programmingmixed networkmixed postman problemprime assigned Euler networkshortest length tour

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cites work

• A fundamental problem in vehicle routing
• Generalized upper bounding techniques
• scientific article; zbMATH DE number 3433636 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3358495 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• On the complexity of edge traversing
• Parallel concepts in graph theory
• Partitioning procedures for solving mixed-variables programming problems
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• The mixed postman problem

Cited in

(7)

• On the windy postman problem on Eulerian graphs
• On the mixed Chinese postman problem
• Routing problems: A bibliography
• A comparison of two different formulations for arc routing problems on mixed graphs
• Approximation algorithms for a mixed postman problem with restrictions on the arcs
• Minimum cost nowhere-zero flows and cut-balanced orientations
• The mixed postman problem

This page was built for publication: The mixed postman problem

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