A genetic algorithm for a class of critical node problems (Q325485): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.endm.2016.03.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2395843226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid constructive heuristics for the critical node problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: VNS solutions for the critical node problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality-Constrained Critical Node Detection Problem / 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: 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: Branch and cut algorithms for detecting critical nodes in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derandomized approximation algorithm for the critical node detection problem / 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

Latest revision as of 17:42, 12 July 2024

scientific article
Language Label Description Also known as
English
A genetic algorithm for a class of critical node problems
scientific article

    Statements

    A genetic algorithm for a class of critical node problems (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2016
    0 references
    critical node problem
    0 references
    cardinality-constrained
    0 references
    graph fragmentation
    0 references
    genetic algorithm
    0 references

    Identifiers