Route inspection problem - Wikipedia, the free encyclopedia
In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed trail (circuit) that visits every edge of a (co...
en.wikipedia.org/wiki/Route_inspection_problem
Sponsored Results Mailman Gives Back
Postman mows lawns for free & inspires a community. Read & Share
www.ResponsibilityProject.com
China Problem
China Problem News Stay Current on Global Markets
Economist.com/China+Problem
Definition of Chinese postman problem, possibly with links to more information and implementations. ... Based on this Alan J. Goldman suggested the name "Chinese Postman problem" to Jack Edmonds when Edmonds was in Goldman's Operations Research group at the U.S. National Bureau of Standards (now NIST).
www.itl.nist.gov/div897/sqg/dads/HTML/chinesePostman.ht... www.itl.nist.gov/div897/sqg/dads/HTML/chinesePostman.html
A similar problem is called Chinese Postman Problem (after the Chinese mathematician, Kwan Mei-Ko, who discovered it in early 1960's). The background of Chinese postman problem is interesting.
eie507.eie.polyu.edu.hk/ss-submission/B7a/
If a graph possesses an Euler tour, then the Chinese postman problem is solved. If a graph has no Euler tour, then at least one edge must be crossed more than once. In a vehicle routing context, we call this deadheading.
eie507.eie.polyu.edu.hk/ss-submission/B7/
The Chinese Postman Problem is to find the shortest route in a network that uses every arc (directed edge) and gets back to where they started (closed problem) or doesn't go back (open problem).
www.uclic.ucl.ac.uk/harold/cpp/
Weisstein, Eric W. "Chinese Postman Problem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/ChinesePostmanProblem.html ...
mathworld.wolfram.com/ChinesePostmanProblem.html mathworld.wolfram.com/ChinesePostmanProblem.html
(classic problem) ... A good algorithm is given in Jack Edmonds and Ellis L. Johnson, Matching, Euler Tours, and the Chinese Postman, Math. Programming, 5:88-124, 1973.
ce.sharif.edu/~ghodsi/ds-alg-dic/HTML/chinesePostman.ht... ce.sharif.edu/~ghodsi/ds-alg-dic/HTML/chinesePostman.html
CiteSeerX - Document Details (Isaac Councill, Lee Giles): The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. ... On the Mixed Chinese Postman Problem (1993) [4 citations — 0 self]
citeseer.ist.psu.edu/ralphs93mixed.html
The Chinese postman problem is a mathematical problem of Graph theory. It is also known as route inspection problem. Suppose there is a mailman who needs to deliver mail to a certain neighborhood. That mailman is lazy, so he wants to find a route through the neighborhood, that meets the following criteria...
simple.wikipedia.org/wiki/Chinese_postman_problem simple.wikipedia.org/wiki/Chinese_postman_problem
Nikolaj van Omme's Scientific Home Page ... I'm reading "the chinese postman problem can be modelized by a transportation problem or by a minimum cost flow problem". What does this all mean ? What is a transportation problem ?
www.crt.umontreal.ca/~nikolaj/tutorials/arcrouting/mini... www.crt.umontreal.ca/~nikolaj/tutorials/arcrouting/miniplay/english/sceneIII_2.html
Sponsored Results Mailman Gives Back
Postman mows lawns for free & inspires a community. Read & Share
www.ResponsibilityProject.com
China Problem
China Problem News Stay Current on Global Markets
Economist.com/China+Problem