Improved formulations for minimum connectivity network interdiction problems (Q1652701): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129977008, #quickstatements; #temporary_batch_1727085673467
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NetworkX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2802091848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying sets of key players in a social network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the critical node problem over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>k</i> shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnecting graphs by removing vertices: a polyhedral approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all simple paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact identification of critical nodes in sparse networks via new compact formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming framework for critical elements detection in graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129977008 / rank
 
Normal rank

Latest revision as of 11:01, 23 September 2024

scientific article
Language Label Description Also known as
English
Improved formulations for minimum connectivity network interdiction problems
scientific article

    Statements

    Improved formulations for minimum connectivity network interdiction problems (English)
    0 references
    11 July 2018
    0 references
    network connectivity
    0 references
    network interdiction
    0 references
    mixed integer linear programming
    0 references
    0 references
    0 references
    0 references

    Identifiers

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