Bilevel model for adaptive network flow problem
From MaRDI portal
Recommendations
- Robust and adaptive network flows
- Protection of flows under targeted attacks
- An iterative security game for computing robust and adaptive network flows
- Parametric multiroute flow and its application to multilink-attack network
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
Cites work
- scientific article; zbMATH DE number 2050722 (Why is no real title available?)
- scientific article; zbMATH DE number 961880 (Why is no real title available?)
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
- Algorithms for network interdiction and fortification games
- Design of Survivable Networks: A survey
- Deterministic network interdiction
- New branch-and-Cut algorithm for bilevel linear programming
- On robust maximum flow with polyhedral uncertainty sets
- Parametric multiroute flow and its application to robust network with \(k\) edge failures
- Removing Arcs from a Network
- Robust and adaptive network flows
- Some properties of the bilevel programming problem
- Stochastic network interdiction
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The network inhibition problem
- Theory and applications of robust optimization
Cited in
(4)- Robust and adaptive network flows
- Protection of flows under targeted attacks
- An iterative security game for computing robust and adaptive network flows
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach
This page was built for publication: Bilevel model for adaptive network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742209)
