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

Shortest path problems with time windows on nodes and arcs

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

DOI10.1006/jmaa.1994.1324zbMath0822.90136OpenAlexW1995774660MaRDI QIDQ1340512

N. G. F. Sancho

Publication date: 18 October 1995

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

Full work available at URL: https://doi.org/10.1006/jmaa.1994.1324


zbMATH Keywords

shortest pathtime windowsrecurrence equation


Mathematics Subject Classification ID

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


Related Items (2)

Shortest path problems with left-side time windows ⋮ The \(k\)-centrum shortest path problem






This page was built for publication: Shortest path problems with time windows on nodes and arcs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1340512&oldid=13467673"
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 13:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki