The dynamic shortest path problem with anticipation (Q852944): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.ejor.2005.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994569469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Management with Guaranteed Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least possible time paths in stochastic, time-varying networks. / 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: Q4887743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Routing for Priority Shipments in LTL Service Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for rerouting shortest paths in dynamic and stochastic 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: Dynamic shortest path in stochastic dynamic networks: Ship routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4158362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic vehicle routing: Status and prospects / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:06, 24 June 2024

scientific article
Language Label Description Also known as
English
The dynamic shortest path problem with anticipation
scientific article

    Statements

    The dynamic shortest path problem with anticipation (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    0 references
    routing
    0 references
    real-time decision making
    0 references
    Markov decision processes
    0 references
    0 references