Robust network design: Formulations, valid inequalities, and computations (Q5326784): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.21497 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161253930 / 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: Flow pack facets of the single node fixed-charge flow polytope / 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: 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: Multi-layer MPLS network design: The impact of statistical multiplexing / 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: 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: A Robust Optimization Approach to Inventory Theory / 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: 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: Source sink flows with capacity installation in batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Least-Cost Nonblocking Broadband Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the VPN tree routing conjecture on ring networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutset Inequalities for Robust Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiperiod network design with incremental routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths, single origin‐destination network design, and associated polyhedra / 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: The robust network loading problem with dynamic routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight formulations for some simple mixed integer programs and convex objective integer programs / 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: 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 6195679
Language Label Description Also known as
English
Robust network design: Formulations, valid inequalities, and computations
scientific article; zbMATH DE number 6195679

    Statements

    Robust network design: Formulations, valid inequalities, and computations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    network design
    0 references
    robust optimization
    0 references
    polyhedral combinatorics
    0 references
    0 references
    0 references

    Identifiers

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