An integer programming framework for critical elements detection in graphs

This study presents an integer programming framework for minimizing the connectivity and cohesiveness properties of a given graph by removing nodes and edges subject to a joint budgetary constraint. The connectivity and cohesiveness metrics are assumed to be general functions of sizes of the remaini...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization Jg. 28; H. 1; S. 233 - 273
Hauptverfasser:	Veremyev, Alexander, Prokopyev, Oleg A., Pasiliao, Eduardo L.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.07.2014
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Critical edge detection Mixed integer programming Critical node detection Network interdiction
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!