A5064516722- Smart Grid Security and Resilience
- Infrastructure Resilience and Vulnerability Analysis
- Facility Location and Emergency Management
- Probabilistic and Robust Engineering Design
- Risk and Portfolio Optimization
- Advanced Control Systems Optimization
- Risk and Safety Analysis
- Simulation Techniques and Applications
Université Paris Dauphine-PSL
2023
Centre National de la Recherche Scientifique
2023
Lamsade
2022
Given a directed graph with capacities and blocker costs associated its arcs, we study the maximum flow problem (MFBP) which asks to find minimum-cost subset of arcs be removed from in such way that remaining maximum-flow value does not exceed given threshold. The MFBP has applications telecommunication networks monitoring civil infrastructures, among others. We propose two integer linear programming (ILP) formulations for are used derive first exact algorithms optimally solve problem. one,...
Given a directed graph with capacities and interdiction costs associated its arcs, the maximum flow blocker problem (MFBP) asks to find minimum-cost subset of arcs be removed from in such way that remaining maximum-flow value does not exceed given threshold. The MFBP has applications telecommunication networks monitoring civil infrastructures, among others. We propose an integer linear programming formulation (ILP) exponential number constraints, called Benders cut, for MFBP. Accordingly, we...