Esteban Salgado

Abstract

Ph.D. Esteban Salgado holds a degree in Industrial Engineering from the Pontificia Universidad Católica de Chile and a Ph.D. in Operations Research from La Sapienza Università di Roma. Since 2024, he has been a full-time professor in the Departamento de Industrias at the Universidad Técnica Federico Santa María, where he teaches courses in Operations Research.

His research areas are in the field of Operations Research, with special emphasis on Mixed-Integer Linear and Non-Linear Optimization. His work focuses on both the theoretical development and practical implementation of efficient formulations and decomposition schemes, particularly for problems over graphs, including applications in power systems.

Academic Background

• Ph.D. in Operations Research, La Sapienza Università di Roma, Italy.
• Master in Operations Research, Université Paris-Saclay, France.
• Engineering Diploma, École Polytechnique, France.
• Industrial Engineering Degree, Pontificia Universidad Católica de Chile, Chile.

Refereed Publications

• Mena, R., Catalán, C., Salgado, E., Viveros, P., & Kristjanpoller, F. (2025). A two-stage stochastic network-constrained unit commitment model for power systems with high wind power integration: A norm-based Benders decomposition approach. Sustainable Energy, Grids and Networks, 43, 101797.
• Gentile, C., Rinaldi, G., & Salgado, E. (2025). SSS algorithms for Max-Cut. INFORMS Journal on Computing, 0(0). (Article in Advance)
• Cohen-Addad, V., Hebdige, M., Král’, D., Li, Z., & Salgado, E. (2017). Steinberg’s Conjecture is false. Journal of Combinatorial Theory, Series B, 122, 452–456.

Selected Proceedings

• Salgado, E., Gentile, C., & Rinaldi, G. (2020). New heuristics for the Max-Cut problem. In 50th Annual Meeting of AIRO – Optimization in Artificial Intelligence and Data Science (ODS), Extended Abstract.
• Salgado, E., & Angulo, G. (2020). Forbidden vertices for some classes of 0–1 polytopes. In 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Extended Abstract.
• Salgado, E., Gentile, C., Rinaldi, G., & Tran, B. D. (2020). A heuristic for Max-Cut in toroidal grid graphs. In 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Extended Abstract.
• Salgado, E., Scozzari, A., Tardella, F., & Liberti, L. (2018). Alternating current optimal power flow with generator selection. In J. Lee, G. Rinaldi, & R. Mahjoub (Eds.), Combinatorial Optimization (Proceedings of ISCO 2018, Lecture Notes in Computer Science, vol. 10856, pp. 364–375). Springer, Cham.
• Salgado, E., Gentile, C., & Liberti, L. (2018). Perspective cuts for the ACOPF with generators. In P. Daniele & L. Scrimali (Eds.), New Trends in Emerging Complex Real Life Problems (AIRO Springer Series, vol. 1, pp. 451–461). Springer, Cham.

Social Research Networks

• • Research Gate: Click Here