Pages that link to "Item:Q1823164"

The following pages link to Finding the most vital arcs in a network (Q1823164):

Displaying 48 items.

• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions (Q264305) (← links)
• Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information (Q291670) (← 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)
• Super edge magic graceful graphs (Q508670) (← links)
• Matching interdiction (Q602686) (← links)
• Finding an anti-risk path between two nodes in undirected graphs (Q732313) (← links)
• Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
• On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
• The k most vital arcs in the shortest path problem (Q1119183) (← links)
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
• The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
• The most vital edges in the minimum spanning tree problem (Q1209313) (← links)
• The fuzzy shortest path problem and its most vital arcs (Q1315875) (← links)
• The single most vital arc in the most economical path problem -- a parametric analysis (Q1317083) (← links)
• Interdicting the activities of a linear program -- a parametric analysis (Q1390246) (← links)
• Finding the most vital node of a shortest path. (Q1401266) (← links)
• A bilevel programming model for proactive countermeasure selection in complex ICT systems (Q1742246) (← links)
• Connectivity interdiction (Q1785279) (← links)
• On the hardness of covering-interdiction problems (Q2031041) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
• Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Heuristics for multi-stage interdiction of stochastic networks (Q2491320) (← links)
• An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
• Finding the \(k\) most vital elements of an s-t planar directed network (Q2723997) (← links)
• Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
• Applying path-counting methods for measuring the robustness of the network-structured system (Q3184587) (← links)
• Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
• Maximizing residual flow under an arc destruction (Q4537607) (← links)
• (Q4551366) (← links)
• On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
• Application of Path Counting Problem and Survivability Function in Analysis of Social Systems (Q5054144) (← links)
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• (Q6084397) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• The critical node game (Q6645160) (← links)