The Postman Problem
Every day a postman will start from the post office and traverse through certain streets to deliver and collect letters and then return to the post office. A natural question to ask is whether there is a rule by which we can find a route that includes all streets he has to pass through so that the length of the route is a minimum. The routing of the garbage trucks in large cities is a similar problem.
KeywordsFeasible Solution Transportation Problem Normal Solution Post Office Euler Tour
Unable to display preview. Download preview PDF.
- Guan Mei Gu. Graphic Programming using Odd and Even Points. Acta Math. Sinica, 10, 3, 1960, 263–266. (also: Chinese Math 1, 1962, 273–277 ).Google Scholar
- Lawler, E.L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.Google Scholar
- Lovász, L. and M.D. Plummer. Matching Theory. Annals of Discrete Mathematics, 29, North Holland, 1986.Google Scholar