Pages that link to "Item:Q1926497"
From MaRDI portal
The following pages link to Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497):
Displaying 50 items.
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
- A genetic algorithm for a class of critical node problems (Q325485) (← links)
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
- Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
- Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
- A cutting-plane algorithm for solving a weighted influence interdiction problem (Q2436687) (← links)
- VNS solutions for the critical node problem (Q2631225) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- The connected critical node problem (Q2672625) (← links)
- Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- On the Independent Set Interdiction Problem (Q5006560) (← links)
- The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
- Finding Critical Links for Closeness Centrality (Q5138269) (← links)
- Critical node/edge detection problems on trees (Q6054014) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)
