Exact methods based on node-routing formulations for undirected arc-routing problems-Reference-Cited by-同舟云学术

Exact methods based on node-routing formulations for undirected arc-routing problems

Published:2005 Issue:1 Volume:47 Page:52-60
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Baldacci R.,Maniezzo V.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference27 articles.

1. Network Routi;Assad,1995

2. Separating capacity constraints in the CVRP using tabu search

3. , , , , , Computational results with a branch and cut code for the capacitated vehicle routing problem, Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble France, 1995.

4. , , The capacitated m-ring star problem, Technical Report 42, DISMI, University of Modena and Reggio Emilia, 2003.

5. , Exact methods based on node routing formulations for arc routing problems, Technical Report UBLCS-2004-10, Department of Computer Science, University of Bologna, Italy, Available at http://www.cs.unibo.it/pub/TR/UBLCS/ABSTRACTS/2004.bib, May 2004.

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

1. An improved multi-objective framework for the Rich arc routing problem;Computers & Operations Research;2023-11

2. Robust drone selective routing in humanitarian transportation network assessment;European Journal of Operational Research;2023-02

3. Teams of robots in additive manufacturing: a review;Virtual and Physical Prototyping;2023-01-23

4. Lagrangian relaxation-based decomposition approaches for the capacitated arc routing problem in the state-space-time network;Transportation Letters;2022-11-22

5. A tailored branch-and-bound algorithm for routing a metro track inspection vehicle;Engineering Optimization;2022-10-25