A branch-and-cut algorithm for two-level survivable network design problems (Q342262): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654124 / rank
 
Normal rank
Property / zbMATH Keywords
 
network design
Property / zbMATH Keywords: network design / rank
 
Normal rank
Property / zbMATH Keywords
 
survivability
Property / zbMATH Keywords: survivability / rank
 
Normal rank
Property / zbMATH Keywords
 
hierarchical networks
Property / zbMATH Keywords: hierarchical networks / rank
 
Normal rank
Property / zbMATH Keywords
 
valid inequalities
Property / zbMATH Keywords: valid inequalities / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134932236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Hierarchical Survivable Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity Upgrade Models for Survivable Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the ring spur assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General network design: a unified view of combined location and network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-connected networks with rings of bounded cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Two-Connected Network with Bounded Meshes Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for self-healing ring network design. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivability in hierarchical telecommunications networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal capacitated ring trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivability in Hierarchical Telecommunications Networks Under Dual Homing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On survivable network polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the plant-cycle location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for network design problems with connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected spanning subgraphs and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Steiner 2-edge connected subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the hub location and routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-edge-connected subgraph polyhedron / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:58, 12 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for two-level survivable network design problems
scientific article

    Statements

    A branch-and-cut algorithm for two-level survivable network design problems (English)
    0 references
    17 November 2016
    0 references
    network design
    0 references
    survivability
    0 references
    hierarchical networks
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references
    0 references
    0 references

    Identifiers

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