Efficient Benders decomposition for distance-based critical node detection problem

F. Hooshmand; F. Mirarabrazi; S.​A. MirHassani

doi:10.1016/j.omega.2019.02.006

ScienceGate Book Chapters

JOURNAL ARTICLE

Efficient Benders decomposition for distance-based critical node detection problem

F. Hooshmand F. Mirarabrazi S.A. MirHassani

Year: 2019 Journal: Omega Vol: 93 Pages: 102037-102037 Publisher: Elsevier BV

DOI: 10.1016/j.omega.2019.02.006

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematical optimization Shortest path problem Mathematics Node (physics) Measure (data warehouse) Residual Linear programming Cutting-plane method Path (computing) Graph Integer programming Algorithm Computer science Discrete mathematics

Metrics

Cited By

2.28

FWCI (Field Weighted Citation Impact)

Refs

0.86

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Reliability and Maintenance Optimization

Physical Sciences → Engineering → Safety, Risk, Reliability and Quality

Infrastructure Resilience and Vulnerability Analysis

Physical Sciences → Engineering → Civil and Structural Engineering

Facility Location and Emergency Management

Social Sciences → Business, Management and Accounting → Organizational Behavior and Human Resource Management

Efficient Benders decomposition for distance-based critical node detection problem

Metrics

Citation History

Topics

Related Documents

Robust Critical Node Selection by Benders Decomposition

Efficient methods for the distance-based critical node detection problem in complex networks

Efficient methods for the distance-based critical node detection problem in complex networks

The distance-based critical node detection problem : models and algorithms

Solving the Distance-Based Critical Node Problem