Efficient heuristic algorithm for identifying critical nodes in planar networks

•The critical node problem (CNP) is NP-Hard on planar graphs.•The objective function of CNP can be transformed into two sub-objectives.•The transformed objectives are evaluated in an efficient manner.•Efficient heuristic for CNP on planar graphs. The critical node problem (CNP) removes a limited num...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2019-06, Vol.106, p.143-153
Hauptverfasser:	Purevsuren, Dalaijargal, Cui, Gang
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial optimization Critical node detection Heuristic Heuristic methods Heuristics Networks Nodes NP-complete Operations research Planar networks Production scheduling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!