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

scientific article

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

zbMath1015.90003MaRDI QIDQ2768395

Justin A. Boyan, Michael Mitzenmacher

Publication date: 29 July 2003


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

transportationbus network problem


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic models in economics (91B70) Deterministic network models in operations research (90B10)


Related Items (6)

The dynamic shortest path problem with anticipation ⋮ PH-graphs for analyzing shortest path problems with correlated traveling times ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison ⋮ Dynamic journeying under uncertainty ⋮ Least expected time paths in stochastic schedule-based transit networks







This page was built for publication:

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