From: spellucci@mathematik.tu-darmstadt.de (Peter Spellucci)
Subject: Re: Optimization: Chinese Postman Problem
Date: 4 Jun 1999 16:15:38 GMT
Newsgroups: sci.math.num-analysis

In article <3755859A.E4A81C52@math.tu-dresden.de>,
 "Ralf Lösche" <loesche@math.tu-dresden.de> writes:
|> Hi there,
|> 
|> I am looking for references on the (Capazitated) Chinese Postman 
|> Problem.
|> Any hints that point to published papers, available algorithms,
|> and codes (free or commercial) are welcome.
|> 
|> Regards, Ralf
a search in "zentralblatt fuer Mathematik" reveals 27 papers on the chinese
postman problem, e.g.
Shen, Yinan N.; Lombardi, Fabrizio
Graph algorithms for conformance testing using the rural Chinese postman tour. 
(English)
[J] SIAM J. Discrete Math. 9, No.4, 511-528 (1996). [ISSN 0895-4801]
normally, such papers itself contain a lot of more references, hence 
looking up these citations should be a good entyr point.
you may use the german matnet to access this information.
hope that helps
peter