Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A dynamic programming solution of a shortest path problem with time constraints on movement and parking

From MaRDI portal
Publication:1191781
Jump to:navigation, search

DOI10.1016/0022-247X(92)90335-BzbMath0763.90087MaRDI QIDQ1191781

N. G. F. Sancho

Publication date: 27 September 1992

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)


zbMATH Keywords

shortest path


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)


Related Items (1)

Parameter-free sampled fictitious play for solving deterministic dynamic programming problems



Cites Work

  • A reoptimization algorithm for the shortest path problem with time windows
  • Shortest path with time constraints on movement and parking
  • An Appraisal of Some Shortest-Path Algorithms
  • Unnamed Item


This page was built for publication: A dynamic programming solution of a shortest path problem with time constraints on movement and parking

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1191781&oldid=13245519"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki