Pages that link to "Item:Q2892322"
From MaRDI portal
The following pages link to Solving the bi-objective maximum-flow network-interdiction problem (Q2892322):
Displaying 38 items.
- Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- Nodal interdiction (Q410061) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- A computational approach to determine damage in infrastructure networks from outage reports (Q523173) (← links)
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences (Q1652509) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
- Analysis of critical damage in the communication network. I: Model and computational experiment (Q1995357) (← links)
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs (Q2050253) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Shortest path network problems with stochastic arc weights (Q2230798) (← links)
- Analysis of critical damage in the communication network. III: Analysis of internode flows (Q2239212) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- An approach to the analysis of possible structural damages in multicommodity network systems (Q2284269) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction (Q2357244) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
- Approximation algorithm for maximum flow network interdiction problem (Q3389526) (← links)
- Bi-objective min-flow problem with capacity and flow constraints (Q3487125) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Bi-objective optimization models for network interdiction (Q5242348) (← links)
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638) (← links)
- Attacker–defender models and road network vulnerability (Q5503981) (← links)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)
- The all-pairs vitality-maximization (VIMAX) problem (Q6588518) (← links)
- Monte Carlo tree search for dynamic shortest-path interdiction (Q6659083) (← links)
