The mixed postman problem

DOI10.1016/0166-218X(79)90016-7zbMath0416.90048MaRDI QIDQ754753

Gary J. Koehler, Charles H. Kappauf

Publication date: 1979

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

zbMATH Keywords

integer programmingmixed networkconnected networkdirected chinese postman problemmixed postman problemprime assigned Euler networkshortest length tour

Mathematics Subject Classification ID

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

Related Items

Routing problems: A bibliography, On the windy postman problem on Eulerian graphs, Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs, A comparison of two different formulations for arc routing problems on mixed graphs, The mixed postman problem, On the mixed Chinese postman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The mixed postman problem
• Partitioning procedures for solving mixed-variables programming problems
• Parallel concepts in graph theory
• Generalized upper bounding techniques
• On the complexity of edge traversing
• A fundamental problem in vehicle routing
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems