Maximizing the minimum source-sink path subject to a budget constraint
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3290885 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Increasing the capacity of a network: the parametric budget problem
Cited in
(76)- Up- and downgrading the 1-center in a network
- Interdicting the activities of a linear program -- a parametric analysis
- Weight reduction problems with certain bottleneck objectives.
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- A note on linearized reformulations for a class of bilevel linear integer problems
- An interdiction game on a queueing network with multiple intruders
- A dynamic reformulation heuristic for generalized interdiction problems
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Finding the most vital arcs in a network
- The stochastic interdiction median problem with disruption intensity levels
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Equilibrium strategies for multiple interdictors on a common network
- The continuous maximum capacity path interdiction problem
- Identifying the critical road combination in urban roads network under multiple disruption scenarios
- Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
- Network interdiction with asymmetric cost uncertainty
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- A survey of network interdiction models and algorithms
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Solving multi-period interdiction via generalized Bender's decomposition
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- Heuristics for multi-stage interdiction of stochastic networks
- Bottleneck capacity expansion problems with general budget constraints
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Optimizing dynamic investment decisions for railway systems protection
- A brief overview of interdiction and robust optimization
- A class of algorithms for mixed-integer bilevel min-max optimization
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Sequential Shortest Path Interdiction with Incomplete Information
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Mitigating interdiction risk with fortification
- Analysis of budget for interdiction on multicommodity network flows
- A nested family of k-total effective rewards for positional games
- Approximation Algorithms for k-Hurdle Problems
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- A class of bottleneck expansion problems
- Matching interdiction
- Upgrading edges in the graphical TSP
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- Logic-based Benders decomposition for wildfire suppression
- Shortest path interdiction problem with convex piecewise-linear costs
- A survey on mixed-integer programming techniques in bilevel optimization
- A two‐stage network interdiction‐monitoring game
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
- Attack and interception in networks
- Approximation algorithms for \(k\)-hurdle problems
- Computation of Nash equilibria of attack and defense games on networks
- Two-stage nodal network interdiction under decision-dependent uncertainty
- Monte Carlo tree search for dynamic shortest-path interdiction
- Markov decision processes and stochastic games with total effective payoff
- b-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets
- k-submodular interdiction problems under distributional risk-receptiveness and robustness: application to machine learning
- Optimal sequential stochastic shortest path interdiction
- Some upgrading problems on networks related to eccentricity concept
- Edge downgrades in the maximal covering location problem
- The Maximal covering location disruption problem
- A modified scenario bundling method for shortest path network interdiction under endogenous uncertainty
- The multi-terminal maximum-flow network-interdiction problem
- Efficient algorithms for robustness in resource allocation and scheduling problems
- Upgrading \(p\)-median problem on a path
- On short paths interdiction problems: Total and node-wise limited interdiction
- Reverse 2-median problem on trees
- Cyclic games and linear programming
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
This page was built for publication: Maximizing the minimum source-sink path subject to a budget constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4143044)
