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

Citations (18)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

W. L. Pearn & W. C. Chiu. (2005) Approximate solutions for the maximum benefit chinese postman problem. International Journal of Systems Science 36:13, pages 815-822.
Read now

Articles from other publishers (17)

Shiqi Tan, Zhiheng Li & Na Xie. (2021) Dynamic Capacitated Arc Routing Problem in E-Bike Sharing System: A Monte Carlo Tree Search Approach. Journal of Advanced Transportation 2021, pages 1-21.
Crossref
Xinye Cai, Chao Xia, Qingfu Zhang, Zhiwei Mei, Han Hu, Lisong Wang & Jun Hu. (2021) The Collaborative Local Search Based on Dynamic-Constrained Decomposition With Grids for Combinatorial Multiobjective Optimization. IEEE Transactions on Cybernetics 51:5, pages 2639-2650.
Crossref
Xingyin Wang & Edward Wasil. (2020) On the road to better routes: Five decades of published research on the vehicle routing problem. Networks 77:1, pages 66-87.
Crossref
Enrique Benavent, Angel Corberán, Isaac Plana & José M. Sanchis. (2011) New facets and an enhanced branch‐and‐cut for the min–max K ‐vehicles windy rural postman problem . Networks 58:4, pages 255-272.
Crossref
Ling Xu & Anthony Stentz. (2011) An efficient algorithm for environmental coverage with multiple robots. An efficient algorithm for environmental coverage with multiple robots.
Jing Zhang. 2011. Advances in Computer Science, Environment, Ecoinformatics, and Education. Advances in Computer Science, Environment, Ecoinformatics, and Education 520 525 .
Rafael Martinelli, Diego Pecin, Marcus Poggi & Humberto Longo. 2011. Experimental Algorithms. Experimental Algorithms 315 326 .
Lining Xing, Philipp Rohlfshagen, Yingwu Chen & Xin Yao. (2010) An Evolutionary Approach to the Multidepot Capacitated Arc Routing Problem. IEEE Transactions on Evolutionary Computation 14:3, pages 356-374.
Crossref
P. M. Franca, F. L. Usberti & A. L. Morelato. (2010) The open Capacitated Arc Routing Problem: Complexity and algorithms. The open Capacitated Arc Routing Problem: Complexity and algorithms.
Enrique Benavent, Angel Corberán, Isaac Plana & José M. Sanchis. (2009) Min‐Max K ‐vehicles windy rural postman problem . Networks 54:4, pages 216-226.
Crossref
Nathalie Perrier, André Langevin & James F. Campbell. (2007) A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal. Computers & Operations Research 34:1, pages 258-294.
Crossref
Peter Greistorfer. (2003) A Tabu Scatter Search Metaheuristic for the Arc Routing Problem. Computers & Industrial Engineering 44:2, pages 249-266.
Crossref
A. Amberg & S. Voss. (2002) A hierarchical relaxations lower bound for the capacitated arc routing problem. A hierarchical relaxations lower bound for the capacitated arc routing problem.
Padma KandulaJeff R. Wright. (1997) Designing Network Partitions to Improve Maintenance Routing. Journal of Infrastructure Systems 3:4, pages 160-168.
Crossref
Gilbert Laporte & Ibrahim H. Osman. (1995) Routing problems: A bibliography. Annals of Operations Research 61:1, pages 227-262.
Crossref
Wen Lea Pearn. (1991) Augment-insert algorithms for the capacitated arc routing problem. Computers & Operations Research 18:2, pages 189-198.
Crossref
Wen Lea Pearn. (1989) Approximate solutions for the capacitated arc routing problem. Computers & Operations Research 16:6, pages 589-600.
Crossref

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.