Travelling time on dense networks

DOI10.1016/0045-7825(77)90031-7zbMath0344.90036OpenAlexW2098037071MaRDI QIDQ1232970

Jonathan Halpern

Publication date: 1977

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(77)90031-7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The shortest route through a network with time-dependent internodal transit times
• Shortest path with time constraints on movement and parking
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Travelling time on dense networks