Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation (Q1642944): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11067-017-9345-2 / 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.1007/s11067-017-9345-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2607843552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding reliable shortest paths in road networks under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal routing for maximizing the travel time reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding efficient and environmentally friendly paths for risk-averse freight carriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive least-expected time paths in stochastic, time-varying transportation and data 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: Optimal path problems with second-order stochastic dominance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(K\) shortest hyperpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking paths in stochastic time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic shortest path problems with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed hypergraph model for random time dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effects of countdown displays in public transport route choice under severe overcrowding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11067-017-9345-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:28, 11 December 2024

scientific article
Language Label Description Also known as
English
Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
scientific article

    Statements

    Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation (English)
    0 references
    0 references
    0 references
    18 June 2018
    0 references
    reliability
    0 references
    robust-cost
    0 references
    stochastic and time-dependent networks
    0 references
    hypergraphs
    0 references
    network optimization
    0 references

    Identifiers

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