A cutting plane algorithm for the capacitated arc routing problem-Reference-Cited by-同舟云学术

A cutting plane algorithm for the capacitated arc routing problem

Published:2003-04 Issue:5 Volume:30 Page:705-728
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Belenguer José M.,Benavent Enrique

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference27 articles.

1. Capacitated arc routing problems;Golden;Networks,1981

2. Tour construction algorithm for the capacitated arc routing problem;Hirabayashi;Asia–Pacific Journal of Operational Research,1992

3. Kiuchi M, Shinano Y, Hirabayashi R, Saruwatari Y. An exact algorithm for the capacitated arc routing problem using Parallel Branch and Bound method, Abstracts of the 1995 Spring National Conference of the Operational Research Society of Japan, 1995. p. 28–9 [in Japanese].

4. The capacitated Chinese postman problem;Assad;American Journal of Mathematical and Management Science,1987

5. New lower bounds for the capacitated arc routing problems;Pearn;Networks,1988

Cited by 117 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model;Journal of Computing in Civil Engineering;2024-05

2. Hybrid Metaheuristic Approaches for the Multi-Depot Rural Postman Problem With Rechargeable and Reusable Vehicles;IEEE Access;2024

3. A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs;2024

4. RoCaSH2: An Effective Route Clustering and Search Heuristic for Large-Scale Multi-Depot Capacitated Arc Routing Problem;IEEE Computational Intelligence Magazine;2023-11

5. Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm;Transportation Science;2023-03