Branch and cut algorithms for detecting critical nodes in undirected graphs
type: Item
instance of: scholarly article
title: Branch and cut algorithms for detecting critical nodes in undirected graphs
zbMATH Open document ID: 1264.90170
author: Marco Di Summa
author: Andrea Grosso
author: Marco Locatelli
published in: Computational Optimization and Applications
publication date: 2013-02-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6137005
zbMATH Keywords: critical node problem
zbMATH Keywords: branch and cut
zbMATH Keywords: valid inequalities
zbMATH Keywords: reformulation-linearization technique
describes a project that uses: PORTA
describes a project that uses: CSDP
MaRDI profile type: Publication
full work available at URL: s10589-012-9458-y
OpenAlex ID: W2065419861
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Detecting critical nodes in sparse graphs
cites work: CSDP, A C library for semidefinite programming
cites work: Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
cites work: Combinatorial optimization. Theory and algorithms
cites work: Graph Theory and Integer Programming
cites work: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
cites work: A cutting plane algorithm for computing \(k\)-edge survivability of a network
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Enhancing RLT relaxations via a new class of semidefinite cuts
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
cites work: Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
cites work: Removing Arcs from a Network
cites work: Deterministic network interdiction
DOI: 10.1007/S10589-012-9458-Y
description: scientific article; zbMATH DE number 6137005