The robust network loading problem with dynamic routing (Q2377165): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996680903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Partition-based facets of the network design problem / 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: The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of robust network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / 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: Q5629416 / 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: The convex hull of two core capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating tight metric inequalities by bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving survivable two-layer network design problems by metric inequalities / 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: Domination Between Traffic Matrices / 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 cut-based inequalities for capacitated network design polyhedra / rank
 
Normal rank

Latest revision as of 14:52, 6 July 2024

scientific article
Language Label Description Also known as
English
The robust network loading problem with dynamic routing
scientific article

    Statements

    The robust network loading problem with dynamic routing (English)
    0 references
    0 references
    28 June 2013
    0 references
    0 references
    network design
    0 references
    demand uncertainty
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references