The Resource constrained shortest path problem implemented in a lazy functional language

Share/Save/Bookmark

Hartel, Pieter H. and Glaser, Hugh (1993) The Resource constrained shortest path problem implemented in a lazy functional language. Journal of Functional Programming, 1 (1). pp. 1-17. ISSN 0956-7968

[img]
Preview
PDF
252Kb
Abstract:The resource constrained shortest path problem is an NP-hard problem for which manyingenious 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 les, 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 comp etitive with a reference FORTRAN implementation.
Item Type:Article
Copyright:© 1993 Cambridge University Press
Link to this item:http://purl.utwente.nl/publications/55706
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page