The multi-terminal maximum-flow network-interdiction problem

DOI10.1016/J.EJOR.2010.12.011zbMATH Open1250.90021OpenAlexW2156245899MaRDI QIDQ713097FDOQ713097

İbrahim Akgün, R. Kevin Wood, B. Tansel

Publication date: 26 October 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/21908

Recommendations

• Deterministic network interdiction
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
• Solving the bi-objective maximum-flow network-interdiction problem
• Approximation algorithm for maximum flow network interdiction problem

zbMATH Keywords

network flowsinteger programmingOR in militarynetwork interdiction

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Maximal Flow Through a Network
• Foundations of bilevel programming
• A bilevel mixed-integer program for critical infrastructure protection planning
• A Two-Sided Optimization for Theater Ballistic Missile Defense
• Multi-level programming and conflict resolution
• The Complexity of Multiterminal Cuts
• Minimal multicut and maximal integer multiflow: a survey
• Deterministic network interdiction
• Removing Arcs from a Network
• Stochastic network interdiction
• Two-Person Zero-Sum Games for Network Interdiction
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Shortest-path network interdiction
• Optimal interdiction policy for a flow network
• Maximizing the minimum source-sink path subject to a budget constraint
• Survivable network design under optimal and heuristic interdiction scenarios
• On the Stackelberg strategy in nonzero-sum games
• A problem in network interdiction
• Optimal interdiction of a supply network
• A global optimization algorithm for reliable network design
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• Design of Communication Networks with Survivability Constraints
• Interception in a network
• Determining the most vital link in a flow network

Cited In (17)

• A \((B + 1)\)-approximation for network flow interdiction with unit costs
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
• The continuous maximum capacity path interdiction problem
• An exact method for binary fortification games
• A multivariate analysis of the strict terminal connection problem
• Deterministic network interdiction
• Stochastic maximum flow interdiction problems under heterogeneous risk preferences
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• The multiroute maximum flow problem revisited
• A bi-level model and memetic algorithm for arc interdiction location-routing problem
• Perfect matching interdiction problem restricted to a stable vertex
• Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
• A survey on mixed-integer programming techniques in bilevel optimization
• A maximum flow problem with intermediate node requirements
• Resolving interferences of triple‐crossover‐cranes by determining paths in networks

This page was built for publication: The multi-terminal maximum-flow network-interdiction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713097)