Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Virtual Private Network Design Under Traffic Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning virtual private networks under traffic uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On capacitated network design cut-set polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity assignment solutions for telecommunications networks with uncertain demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / 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: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power and limitations of affine policies in two-stage adaptive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of robust network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic routing under disjoint dominant extreme demands / 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: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust network loading problem with dynamic routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions for network design under transportation cost and demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity expansion of network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Between Traffic Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cut-based inequalities for capacitated network design polyhedra / 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 17:10, 6 July 2024

scientific article; zbMATH DE number 6195682
Language Label Description Also known as
English
Affine recourse for the robust network design problem: Between static and dynamic routing
scientific article; zbMATH DE number 6195682

    Statements

    Affine recourse for the robust network design problem: Between static and dynamic routing (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    robust optimization
    0 references
    network design
    0 references
    recourse
    0 references
    affine adjustable robust counterparts
    0 references
    affine routing
    0 references
    demand polytope
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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