A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2023.106363 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital arcs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Multi-Criterion Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Multi-Criterion Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network interdiction through length-bounded critical disruption paths: a bi-objective approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network interdiction via a critical disruption path: branch-and-price algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical node detection problem in networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding two disjoint paths with min-max objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex blocker clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vulnerability of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem / 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: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of network interdiction models and algorithms / 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: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quick method for finding shortest pairs of disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective optimization using metaheuristics: non‐standard algorithms / 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: A Fast Greedy Algorithm for the Critical Node Detection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical node structures on graphs: A mathematical programming approach / 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: Matching interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epidemic dynamics on complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817401 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2023.106363 / rank
 
Normal rank

Latest revision as of 18:08, 30 December 2024

scientific article; zbMATH DE number 7764410
Language Label Description Also known as
English
A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
scientific article; zbMATH DE number 7764410

    Statements

    A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (English)
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    networks
    0 references
    critical disruption path
    0 references
    mixed integer programming
    0 references
    multiple objective optimisation
    0 references
    metaheuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers