Robust optimization of graph partitioning and critical node detection in analyzing networks

DOI10.1007/978-3-642-17458-2_15MaRDI QIDQ3066154zbMATH OpenOpenAlexFDO

Authors Neng Fan, Panos M. Pardalos

Publication date 8 January 2011

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17458-2_15

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Robust optimization of graph partitioning involving interval uncertainty
• Robust critical node selection by Benders decomposition
• An optimal approach for the critical node problem using semidefinite programming
• Detecting critical node structures on graphs: a mathematical programming approach
• A fast greedy algorithm for the critical node detection problem

Cited in

(14)

• Graph clustering with Boltzmann machines
• Component-cardinality-constrained critical node problem in graphs
• Optimal detection of critical nodes: improvements to model structure and performance
• The stochastic critical node problem over trees
• Graph clustering via intra-cluster density maximization
• Robust critical node selection by Benders decomposition
• Critical node/edge detection problems on trees
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Robust optimization of graph partitioning involving interval uncertainty
• The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
• Exact identification of critical nodes in sparse networks via new compact formulations
• The critical node detection problem in networks: a survey
• A robust optimization approach for multicast network coding under uncertain link costs

This page was built for publication: Robust optimization of graph partitioning and critical node detection in analyzing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066154)