Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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 / OpenAlex ID
 
Property / OpenAlex ID: W2030583267 / 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: Models and Algorithms for Robust Network Design with Several Traffic Scenarios / 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: 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 solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / 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: An Exact Algorithm for Robust Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of a Communication Net / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity search for 0--1 mixed-integer convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Generalized Linear Programming to Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / 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 robust network loading problem with dynamic routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:11, 12 July 2024

scientific article
Language Label Description Also known as
English
Single-commodity robust network design problem: complexity, instances and heuristic solutions
scientific article

    Statements

    Single-commodity robust network design problem: complexity, instances and heuristic solutions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    robustness
    0 references
    network design
    0 references
    complexity
    0 references
    heuristic
    0 references
    proximity search
    0 references

    Identifiers

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