A lower bound for the Node, Edge, and Arc Routing Problem-Reference-Cited by-同舟云学术

A lower bound for the Node, Edge, and Arc Routing Problem

Published:2013-04 Issue:4 Volume:40 Page:943-952
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Bach Lukas,Hasle Geir,Wøhlk Sanne

Publisher

Elsevier BV

Subject

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

Reference37 articles.

1. Distribution Innovation Home Page 〈http://www.di.no/?lang=en〉 [accessed 27.07.12].

2. NEARP Web Pages 〈http://www.sintef.no/NEARP〉 [accessed 27.07.12].

3. Spider Web Pages 〈http://www.sintef.no/Projectweb/Transportation-planning/Software/Spider/〉 [accessed 27.07.12].

4. Ahr Dino. Contributions to multiple postmen problems. PhD thesis. University of Heidelberg; 2004.

5. Amberg Anita, Voss Stefan. A hierarchical relaxations lower bound for the capacitated arc routing problem. In: Proceedings of the 35th annual hawaii international conference on system sciences, vol. 3; 2002.

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

1. Reassigning Departure Slots with Preferences of the Airline and Passengers;Transportation Research Record: Journal of the Transportation Research Board;2023-07-05

2. A robust optimization approach for a multi-period location-arc routing problem with time windows: A case study of a bank;INT J NONLINEAR ANAL;2021

3. Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs;Networks;2020-09-25

4. The mixed capacitated general routing problem with time‐dependent demands;Networks;2020-09-09

5. Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows;European Journal of Operational Research;2018-05