A comparison of routing sets for robust network design (Q479214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Provisioning virtual private networks under traffic uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust routing and optimal partitioning of a traffic demand polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Adaptability in Multistage Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of robust network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Least-Cost Nonblocking Broadband Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic vs. oblivious routing in network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust network design: Formulations, valid inequalities, and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity expansion of network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine recourse for the robust network design problem: Between static and dynamic routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improving optimal oblivious routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank

Latest revision as of 10:30, 9 July 2024

scientific article
Language Label Description Also known as
English
A comparison of routing sets for robust network design
scientific article

    Statements

    A comparison of routing sets for robust network design (English)
    0 references
    0 references
    5 December 2014
    0 references
    network flows
    0 references
    robust optimization
    0 references
    network design
    0 references
    routing set
    0 references
    routing template
    0 references
    0 references
    0 references

    Identifiers