Top-percentile traffic routing problem by dynamic programming (Q2443403): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Competitive routing in networks with polynomial costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top percentile network pricing and the economics of multi-homing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A manufacturing network design model based on processor and worker capabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank

Latest revision as of 13:25, 7 July 2024

scientific article
Language Label Description Also known as
English
Top-percentile traffic routing problem by dynamic programming
scientific article

    Statements

    Top-percentile traffic routing problem by dynamic programming (English)
    0 references
    0 references
    0 references
    7 April 2014
    0 references
    top-percentile
    0 references
    multi-homing
    0 references
    mixed-integer stochastic programming problem
    0 references
    dynamic programming
    0 references

    Identifiers