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

DOI10.1017/S0956796800001568MaRDI QIDQ4880525zbMATH OpenOpenAlexFDO

Authors Pieter Hartel, Hugh Glaser

Publication date 9 June 1996

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796800001568

zbMATH Keywords

resource constrained shortest path problem

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• An algorithm for the resource constrained shortest path problem
• scientific article; zbMATH DE number 1670670
• A computational study of solution approaches for the resource constrained elementary shortest path problem
• Algorithms for non-linear and stochastic resource constrained shortest path
• Shorter Path Constraints for the Resource Constrained Shortest Path Problem

Cites work

• A dual algorithm for the constrained shortest path problem
• An algorithm for the resource constrained shortest path problem
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• Shortest chain subject to side constraints
• Using circular programs to eliminate multiple traversals of data

Cited in

(1)

• The application of the functional programming language \textit{Miranda} in the enumeration algorithms of \(k\)-optimal paths

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: The resource constrained shortest path problem implemented in a lazy functional language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880525)