The following pages link to Removing Arcs from a Network (Q5602573):
Displaying 50 items.
- Hybrid constructive heuristics for the critical node problem (Q271993) (← 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)
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- Protection issues for supply systems involving random attacks (Q336905) (← links)
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
- A bi-level programming model for protection of hierarchical facilities under imminent attacks (Q342087) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification (Q709153) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Optimizing fortification plan of capacitated facilities with maximum distance limits (Q1735969) (← links)
- Bilevel model for adaptive network flow problem (Q1742209) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- An analytical approach to the protection planning of a rail intermodal terminal network (Q1752835) (← links)
- An interdiction game on a queueing network with multiple intruders (Q1753530) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- Deterministic network interdiction (Q1804095) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
- A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537) (← links)
- An exact solution approach for the interdiction median problem with fortification (Q2477666) (← links)
- VNS solutions for the critical node problem (Q2631225) (← links)
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection (Q2664335) (← links)
- An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach (Q2676287) (← links)
