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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial optimization Ročník 28; číslo 1; s. 233 - 273
Hlavní autori:	Veremyev, Alexander, Prokopyev, Oleg A., Pasiliao, Eduardo L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.07.2014
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!