Minimum cost edge blocker clique problem (Q827246): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127447228, #quickstatements; #temporary_batch_1722372779079
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MCODE / 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.1007/s10479-019-03315-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963128532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two extended formulations for cardinality maximum flow network interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital nodes with respect to independent set and vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / 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: Branch and cut algorithms for detecting critical nodes in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound and exact methods for assessing link vulnerability in complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction policy for a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital edges in the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex blocker clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum edge blocker dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms for mixed-integer bilevel min-max optimization / 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 / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On biconnected and fragile subgraphs of low diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow interdiction on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127447228 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Minimum cost edge blocker clique problem
scientific article

    Statements

    Minimum cost edge blocker clique problem (English)
    0 references
    7 January 2021
    0 references
    edge blocker
    0 references
    maximum weighted clique
    0 references
    NP-hard
    0 references
    exact algorithms
    0 references
    network interdiction
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers