Advanced search
Publication Cover
American Journal of Mathematical and Management Sciences Volume 7, 1987 - Issue 1-2
Submit an article Journal homepage
50
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases

Arjang A. AssadCollege of Business and Management University of MarylandCollege Park, MD20742
,
Wen-Lea PearnDepartment of MathematicsUniv. of California at FresnoFresno, CA
&
Bruce L. GoldenCollege of Business and Management University of MarylandCollege Park, MD20742
Pages 63-88 | Published online: 14 Aug 2013

  • BeltramiE. and BodinL. (1974). Networks and vehicle routing for municipal waste collection. Networks, 4, 65–94.
  • BenaventE., CamposV., CorberanA. and MotaE. (1985). A heuristic algorithm for the capacitated Chinese postman problem. Paper presented at the Seventh European OR Congress, Bologna, Italy.
  • BergeC. (1973). Graphs and Hypergraphs. North-Holland, Amsterdam.
  • BodinL., GoldenB., AssadA. and BallM. (1983). Routing and scheduling of vehicles and crews. Computers & Operations Research, 10, 63–211.
  • ChapleauL., FerlandJ., LapalmeG. and RousseauJ.M. (1984). A parallel insert method for the capacitated arc routing problem. Operations Research Letters, 3, 95–99.
  • ChristofidesN. (1973). The optimum traversal of a graph. Omega, 1, 719–732.
  • ChristofidesN., CamposV., CorboranA. and MotaE. (1981). An algorithm for the rural postman problem. Technical Report ICOR 81–5, Department of Management Science, Imperial College, London.
  • EdmondsJ. and JohnsonE. (1973). Matching, Euler tours and the Chinese postman. Mathematical Programming, 5, 88–124.
  • GareyM. and JohnsonD. (1979). Computers and Intractability. Freeman, San Francisco.
  • GoldenB. L., DeArmonJ.S. and BakerE. K. (1983). Computational experiments with algorithms for a class of routing problems. Computers & Operations Research, 10, 47–59.
  • GoldenB.L. and WongR.T. (1981). Capacitated arc routing problems. Networks, 11, 305–315.
  • PearnW. L. (1984). The capacitated Chinese postman problem. Unpublished Ph.D. dissertation, Department of Mathematics, University of Maryland, College ParkMaryland.
  • SternH. and DrorM. (1979). Routing electric meter readers. Computers & Operations Research, 6, 209–223.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.