Bilevel model for adaptive network flow problem
From MaRDI portal
Publication:1742209
DOI10.1016/j.endm.2018.01.012zbMath1392.90020OpenAlexW2792052602WikidataQ130205002 ScholiaQ130205002MaRDI QIDQ1742209
Vorapong Suppakitpaisarn, Pierre-Louis Poirion, Jean-François Baffier
Publication date: 11 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.012
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- On robust maximum flow with polyhedral uncertainty sets
- Some properties of the bilevel programming problem
- Deterministic network interdiction
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- New branch-and-Cut algorithm for bilevel linear programming
- Stochastic Network Interdiction
- Theory and Applications of Robust Optimization
- Parametric Multiroute Flow and Its Application to Robust Network with $$k$$ Edge Failures
- Robust and Adaptive Network Flows
- The network inhibition problem
- Design of Survivable Networks: A survey
- Removing Arcs from a Network
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bilevel model for adaptive network flow problem