Heuristics for the network design problem with connectivity requirements (Q281782): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact approaches for solving robust prize-collecting Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalizations of network design problems with degree bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-bound algorithms for k-cardinality tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the SPANNING \(k\)-TREE problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some optimization problems on \(k\)-trees and partial \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Recovery Guarantees for Sparsely Corrupted Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some network design problems with degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective 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: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank

Latest revision as of 23:28, 11 July 2024

scientific article
Language Label Description Also known as
English
Heuristics for the network design problem with connectivity requirements
scientific article

    Statements

    Heuristics for the network design problem with connectivity requirements (English)
    0 references
    0 references
    0 references
    11 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-trees
    0 references
    robust networks
    0 references
    network design
    0 references
    heuristics
    0 references
    variable neighborhood search
    0 references
    0 references