Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings (Q2670574): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114184434, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic fleet management. Concepts, systems, algorithms \& case studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best routes selection in international intermodal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-order cone programming approach for linear programs with joint probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum probability shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of applied mathematics with a software overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended dominance and a stochastic shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic journeying under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Optimization Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved quick hypervolume algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of calculating the volume of a polyhedron is enumerably hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A box decomposition algorithm to compute the hypervolume indicator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an exact method for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for linear programs with probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunities for OR in intermodal freight transport research: A review. / 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: Algorithms for non-linear and stochastic resource constrained shortest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of resource constrained shortest path problems: Exact solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Itinerary planning with time budget for risk-averse travelers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays / rank
 
Normal rank

Latest revision as of 07:21, 28 July 2024

scientific article
Language Label Description Also known as
English
Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
scientific article

    Statements

    Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings (English)
    0 references
    0 references
    0 references
    11 March 2022
    0 references
    logistics
    0 references
    intermodal transport
    0 references
    stochastic shortest path
    0 references
    certainty equivalent
    0 references
    overbookings
    0 references

    Identifiers

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