Pages that link to "Item:Q5627901"

The following pages link to Optimal interdiction of a supply network (Q5627901):

Displaying 43 items.

• 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)
• 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)
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
• Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
• Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
• The multi-terminal maximum-flow network-interdiction problem (Q713097) (← 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)
• Network flow interdiction on planar graphs (Q987697) (← links)
• Interdicting the activities of a linear program -- a parametric analysis (Q1390246) (← links)
• The \(q\)-ad hoc hub location problem for multi-modal networks (Q1642959) (← links)
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
• Deterministic network interdiction (Q1804095) (← links)
• The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
• A study of general and security Stackelberg game formulations (Q1999631) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← 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)
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
• Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
• An exact solution approach for the interdiction median problem with fortification (Q2477666) (← links)
• A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection (Q2664335) (← links)
• Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← 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)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← 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)
• The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)
• Attack and interception in networks (Q6180414) (← links)
• How vulnerable is an undirected planar graph with respect to max flow (Q6196897) (← links)
• Computation of Nash equilibria of attack and defense games on networks (Q6546276) (← links)
• The all-pairs vitality-maximization (VIMAX) problem (Q6588518) (← links)