Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem-Reference-Cited by-同舟云学术

Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem

Published:2009-07 Issue:4 Volume:53 Page:358-381
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Muhandiramge Ranga,Boland Natashia

Publisher

Wiley

Subject

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

Reference24 articles.

1. Shortest chain subject to side constraints;Aneja;Networks,1983

2. Flight string models for aircraft fleeting and routing;Barnhart;Transport Sci,1998

3. An algorithm for the resource constrained shortest path problem;Beasley;Networks,1989

4. On a routing problem;Bellman;Q Appl Math,1958

5. D. Blokh and G. Gutin, An approximation algorithm for combinatorial optimization problems with two parameters, University of Southern Denmark (January 1995).

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

1. A two-stage method for doubly resource constrained elementary shortest path problems;Knowledge-Based Systems;2024-06

2. Enhanced methods for the weight constrained shortest path problem;Networks;2024-02-13

3. A multiphase dynamic programming algorithm for the shortest path problem with resource constraints;European Journal of Operational Research;2023-12

4. Heuristics for the Canadian traveler problem with neutralizations;Computers & Industrial Engineering;2021-09

5. A Primal Adjacency-Based Algorithm for the Shortest Path Problem with Resource Constraints;Transportation Science;2020-09