4.6 Article

Branch and cut algorithms for detecting critical nodes in undirected graphs

Related references

Note: Only part of the references are listed.
Article Computer Science, Interdisciplinary Applications

Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Timothy C. Matisziw et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Computer Science, Interdisciplinary Applications

Detecting critical nodes in sparse graphs

Ashwin Arulselvan et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Operations Research & Management Science

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

Kurt M. Anstreicher

JOURNAL OF GLOBAL OPTIMIZATION (2009)

Proceedings Paper Computer Science, Information Systems

Identifying Critical Nodes in Protein-Protein Interaction Networks

Vladimir Boginski et al.

CLUSTER CHALLENGES IN BIOLOGICAL NETWORKS (2009)

Article Engineering, Industrial

Algorithms for discrete and continuous multicommodity flow network interdiction problems

Churlzu Lim et al.

IIE TRANSACTIONS (2007)

Article Management

A cutting plane algorithm for computing k-edge survivability of a network

YS Myung et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)

Article Operations Research & Management Science

Enhancing RLT relaxations via a new class of semidefinite cuts

HD Sherali et al.

JOURNAL OF GLOBAL OPTIMIZATION (2002)