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

Full description

Bibliographic Details

Published in:	Journal of combinatorial optimization Vol. 28; no. 1; pp. 233 - 273
Main Authors:	Veremyev, Alexander, Prokopyev, Oleg A., Pasiliao, Eduardo L.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.07.2014
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!