Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price

2013 ◽  
Vol 40 (1) ◽  
pp. 385-394 ◽  
Author(s):  
Xiaoyan Zhu ◽  
Wilbert E. Wilhelm
Keyword(s):  
Shortest Path ◽  
Branch And Price ◽  
Resource Constrained ◽  
Constrained Shortest Path ◽  
Dynamic Resource ◽  
Resource Constrained Shortest Path

scholarly journals The resource constrained shortest path problem implemented in a lazy functional language

1996 ◽  
Vol 6 (1) ◽  
pp. 29-46
Author(s):  
Pieter H. Hartel ◽  
Hugh Glaser
Keyword(s):  
Shortest Path ◽  
Imperial College ◽  
Shortest Path Problem ◽  
Functional Language ◽  
Resource Constrained ◽  
Constrained Shortest Path ◽  
Np Hard Problem ◽  
Fortran Implementation ◽  
Data Files ◽  
Resource Constrained Shortest Path

AbstractThe resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in Fortran or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional language. Benefits accrue in the software engineering of the implementations. Our implementations have been applied to a standard benchmark of data files, which is available from the Operational Research Library of Imperial College, London. The performance of the lazy functional implementations, even with the comparatively simple algorithms that we have used, is competitive with a reference Fortran implementation.

Sign in / Sign up

Export Citation Format

Share Document