Hybrid constructive heuristics for the critical node problem (Q271993): Difference between revisions

From MaRDI portal
Import241208061232 (talk | contribs)
Normalize DOI.
Import recommendations run Q6767936
Property / Recommended article
 
Property / Recommended article: An optimal approach for the critical node problem using semidefinite programming / rank
 
Normal rank
Property / Recommended article: An optimal approach for the critical node problem using semidefinite programming / qualifier
 
Similarity Score: 0.88503766
Amount0.88503766
Unit1
Property / Recommended article: An optimal approach for the critical node problem using semidefinite programming / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3792470 / rank
 
Normal rank
Property / Recommended article: Q3792470 / qualifier
 
Similarity Score: 0.867139
Amount0.867139
Unit1
Property / Recommended article: Q3792470 / qualifier
 
Property / Recommended article
 
Property / Recommended article: A genetic algorithm for a class of critical node problems / rank
 
Normal rank
Property / Recommended article: A genetic algorithm for a class of critical node problems / qualifier
 
Similarity Score: 0.8667147
Amount0.8667147
Unit1
Property / Recommended article: A genetic algorithm for a class of critical node problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: A hybrid heuristic for the maximum clique problem / rank
 
Normal rank
Property / Recommended article: A hybrid heuristic for the maximum clique problem / qualifier
 
Similarity Score: 0.8663854
Amount0.8663854
Unit1
Property / Recommended article: A hybrid heuristic for the maximum clique problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Component-cardinality-constrained critical node problem in graphs / rank
 
Normal rank
Property / Recommended article: Component-cardinality-constrained critical node problem in graphs / qualifier
 
Similarity Score: 0.86555904
Amount0.86555904
Unit1
Property / Recommended article: Component-cardinality-constrained critical node problem in graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Efficient heuristic algorithm for identifying critical nodes in planar networks / rank
 
Normal rank
Property / Recommended article: Efficient heuristic algorithm for identifying critical nodes in planar networks / qualifier
 
Similarity Score: 0.8628751
Amount0.8628751
Unit1
Property / Recommended article: Efficient heuristic algorithm for identifying critical nodes in planar networks / qualifier
 
Property / Recommended article
 
Property / Recommended article: Efficient implementation of heuristics for the continuous network design problem / rank
 
Normal rank
Property / Recommended article: Efficient implementation of heuristics for the continuous network design problem / qualifier
 
Similarity Score: 0.86143255
Amount0.86143255
Unit1
Property / Recommended article: Efficient implementation of heuristics for the continuous network design problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: A hybrid heuristic for the diameter constrained minimum spanning tree problem / rank
 
Normal rank
Property / Recommended article: A hybrid heuristic for the diameter constrained minimum spanning tree problem / qualifier
 
Similarity Score: 0.86034906
Amount0.86034906
Unit1
Property / Recommended article: A hybrid heuristic for the diameter constrained minimum spanning tree problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3481517 / rank
 
Normal rank
Property / Recommended article: Q3481517 / qualifier
 
Similarity Score: 0.8602694
Amount0.8602694
Unit1
Property / Recommended article: Q3481517 / qualifier
 

Revision as of 07:23, 17 April 2025

scientific article
Language Label Description Also known as
English
Hybrid constructive heuristics for the critical node problem
scientific article

    Statements

    Hybrid constructive heuristics for the critical node problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 April 2016
    0 references
    critical node problem
    0 references
    graph fragmentation
    0 references
    hybrid heuristics
    0 references

    Identifiers