Dynamic shortest path problems: hybrid routing policies considering network disruptions (Q336651): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2013.06.014 / rank
Normal rank
 
Property / author
 
Property / author: Q336649 / rank
Normal rank
 
Property / author
 
Property / author: Ton G. de Kok / rank
Normal rank
 
Property / author
 
Property / author: Nico P. Dellaert / rank
 
Normal rank
Property / author
 
Property / author: Ton G. de Kok / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPSS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.06.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057734091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new model for path planning with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust path choice in networks with failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic shortest path problems with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online shortest path problem with limited arc cost dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic shortest path problem with anticipation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical decision functions which minimize the maximum risk / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2013.06.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:47, 9 December 2024

scientific article
Language Label Description Also known as
English
Dynamic shortest path problems: hybrid routing policies considering network disruptions
scientific article

    Statements

    Dynamic shortest path problems: hybrid routing policies considering network disruptions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    dynamic shortest path problem
    0 references
    dynamic programming
    0 references
    disruption handling
    0 references
    transportation
    0 references
    online routing
    0 references
    offline routing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references