23 citations · 23 across the 3 of their papers we have counts for
3 papers
math.OC2024
Exponential Conic Relaxations for Signomial Geometric Programming
Milad Dehghani Filabadi, Chen Chen
Signomial geometric programming (SGP) is a computationally challenging, NP-Hard class of nonconvex nonlinear optimization problems. SGP can be solved iteratively using a sequence o…
math.OC2021
Robust-and-Cheap Framework for Network Resilience: A Novel Mixed-Integer Formulation and Solution Method
Milad Dehghani Filabadi
Resilience and robustness are important properties in the reliability and attack-tolerance analysis of networks. In recent decades, various qualitative and heuristic-based quantita…
math.OC2019★ 23 cited
Effective Budget of Uncertainty for Classes of Robust Optimization
Milad Dehghani Filabadi, Houra Mahmoudzadeh
Robust optimization (RO) tackles data uncertainty by optimizing for the worst-case scenario of an uncertain parameter and, in its basic form, is sometimes criticized for producing…