Detecting critical node structures on graphs: a mathematical programming approach
From MaRDI portal
Recommendations
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- An integer programming framework for critical elements detection in graphs
- Detecting critical nodes in sparse graphs
- A fast greedy algorithm for the critical node detection problem
- Optimal detection of critical nodes: improvements to model structure and performance
Cites work
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- A derandomized approximation algorithm for the critical node detection problem
- A Modified Linear Program for Columnar Methods in Mathematical Programming
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- A tutorial on column generation and branch-and-price for vehicle routing problems
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- An integer programming framework for critical elements detection in graphs
- Blockers and transversals
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Branch-and-price: Column generation for solving huge integer programs
- Cluster analysis and mathematical programming
- Collective dynamics of `small-world' networks
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- Complexity of the critical node problem over trees
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Disconnecting graphs by removing vertices: a polyhedral approach
- Epidemic dynamics on complex networks
- Exact identification of critical nodes in sparse networks via new compact formulations
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Facets of the clique partitioning polytope
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- How to Cut a Graph into Many Pieces
- scientific article; zbMATH DE number 2084315 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- Identifying sets of key players in a social network
- Increasing the Weight of Minimum Spanning Trees
- Integer programming models for the multidimensional assignment problem with star costs
- Interior point stabilization for column generation
- Matching interdiction
- Minimum edge blocker dominating set problem
- Minimum vertex blocker clique problem
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- Most vital links and nodes in weighted networks
- Network flows. Theory, algorithms, and applications.
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Nodal interdiction
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Removing Arcs from a Network
- Robust critical node selection by Benders decomposition
- Selected Topics in Column Generation
- Shortest-path network interdiction
- Stabilized column generation
- Statistical mechanics of complex networks
- Technical Note—“Linear” Programming with Absolute-Value Functionals
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The centrality of groups and classes
- The critical node detection problem in networks: a survey
- The most vital nodes with respect to independent set and vertex cover
- The node-deletion problem for hereditary properties is NP-complete
- The University of Florida sparse matrix collection
- The Valve Location Problem in Simple Network Topologies
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
Cited in
(17)- Detecting critical nodes in sparse graphs
- An optimal approach for the critical node problem using semidefinite programming
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Construction of simple path graphs in transport networks. I: General solutions and examples
- Optimal detection of critical nodes: improvements to model structure and performance
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Integer programming methods for solving binary interdiction games
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- An integer programming framework for critical elements detection in graphs
- Computing Critical Nodes in Directed Graphs
- The critical node problem based on connectivity index and properties of components on trees
- Solving the Distance-Based Critical Node Problem
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches
- The stochastic critical node problem over trees
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Two-stage nodal network interdiction under decision-dependent uncertainty
This page was built for publication: Detecting critical node structures on graphs: a mathematical programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628045)
