Pages that link to "Item:Q929289"
From MaRDI portal
The following pages link to On short paths interdiction problems: Total and node-wise limited interdiction (Q929289):
Displaying 50 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- On the union of intermediate nodes of shortest paths (Q358654) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Matching interdiction (Q602686) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- A bilevel programming model for proactive countermeasure selection in complex ICT systems (Q1742246) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- On the hardness of covering-interdiction problems (Q2031041) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Interdicting facilities in tree networks (Q2121611) (← 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)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- On the \(p\)-hub interdiction problem (Q2664408) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← 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)
- Symmetric interdiction for matching problems (Q5002612) (← links)
- (Q5021006) (← links)
- Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← 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)
