The mixed postman problem
From MaRDI portal
Publication:754753
DOI10.1016/0166-218X(79)90016-7zbMATH Open0416.90048MaRDI QIDQ754753FDOQ754753
Gary J. Koehler, Charles H. Kappauf
Publication date: 1979
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
integer programmingmixed networkconnected networkdirected chinese postman problemmixed postman problemprime assigned Euler networkshortest length tour
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A fundamental problem in vehicle routing
- Matching, Euler tours and the Chinese postman
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- Title not available (Why is that?)
- Parallel concepts in graph theory
- On the complexity of edge traversing
- Networks and vehicle routing for municipal waste collection
- Generalized upper bounding techniques
- Title not available (Why is that?)
- Title not available (Why is that?)
- The mixed postman problem
Cited In (6)
- Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs
- On the mixed Chinese postman problem
- The mixed postman problem
- A comparison of two different formulations for arc routing problems on mixed graphs
- Routing problems: A bibliography
- On the windy postman problem on Eulerian graphs
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)
