OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Mustafa Çelebi Pinar / rank
Normal rank
 
Property / author
 
Property / author: Mustafa Çelebi Pinar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINTO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064784845 / 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: Optimal oblivious routing in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal oblivious routing under linear and ellipsoidal 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 solutions of uncertain linear programs / 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: Routing, merging, and sorting on parallel models of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Internet Protocol network design and routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Between Traffic Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On open shortest path first related network optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / 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
Property / cites work
 
Property / cites work: Edge-based traffic engineering for OSPF networks / rank
 
Normal rank

Latest revision as of 00:10, 7 July 2024

scientific article
Language Label Description Also known as
English
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
scientific article

    Statements

    OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    OSPF
    0 references
    oblivious routing
    0 references
    traffic engineering
    0 references
    ECMP
    0 references
    branch-and-price
    0 references
    traffic uncertainty
    0 references
    0 references