Pages that link to "Item:Q4785225"
From MaRDI portal
The following pages link to Shortest-path network interdiction (Q4785225):
Displaying 50 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
- An extended network interdiction problem for optimal toll control (Q325471) (← links)
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490) (← 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)
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model (Q342516) (← links)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
- Nodal interdiction (Q410061) (← links)
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Matching interdiction (Q602686) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- A reinforcement learning approach to convoy scheduling on a contested transportation network (Q895789) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- An exact approach for the \(r\)-interdiction covering problem with fortification (Q1725826) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- Wireless LAN transmitter location under the threat of jamming attacks (Q1734815) (← links)
- Radio communications interdiction problem under deterministic and probabilistic jamming (Q1738838) (← links)
- A bilevel programming model for proactive countermeasure selection in complex ICT systems (Q1742246) (← links)
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance (Q1751769) (← 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)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Benders decomposition: solving binary master problems by enumeration (Q1785474) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
- The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
