Pages that link to "Item:Q4143044"

The following pages link to Maximizing the minimum source-sink path subject to a budget constraint (Q4143044):

Displaying 50 items.

• Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
• A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← 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)
• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
• Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
• Reverse 2-median problem on trees (Q943832) (← links)
• Cyclic games and linear programming (Q944703) (← links)
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
• Up- and downgrading the 1-center in a network (Q1026756) (← links)
• Interdicting the activities of a linear program -- a parametric analysis (Q1390246) (← links)
• Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
• Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
• Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
• A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
• An interdiction game on a queueing network with multiple intruders (Q1753530) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
• Finding the most vital arcs in a network (Q1823164) (← 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)
• Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• Identifying the critical road combination in urban roads network under multiple disruption scenarios (Q2096764) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← 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 game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
• Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← 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)
• 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)
• Heuristics for multi-stage interdiction of stochastic networks (Q2491320) (← links)
• Bottleneck Capacity Expansion Problems with General Budget Constraints (Q2765595) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
• Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
• Shortest path network interdiction with asymmetric information (Q3184598) (← links)
• A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
• A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)