For my (possibly outdated) CV click HERE.
Submitted and Working Papers
- On the implementation and strengthening of intersection cuts for QCQPs.
Chmiela A., Muñoz G. and Serrano F. Submitted. - Cutting Plane Generation Through Sparse Principal Component Analysis.
Dey S., Kazachkov A., Lodi A. and Muñoz G. Submitted. - Maximal Quadratic-free Sets.
Muñoz G. and Serrano F. Submitted. - On Generalized Surrogate Duality in Mixed-Integer Non-Linear Programming.
Müller B., Muñoz G., Gasse M., Gleixner A., Lodi A. and Serrano F. Submitted. - Principled Deep Neural Network Training through Linear Programming.
Bienstock D., Muñoz G. and Pokutta S. Working paper.
Journal Publications
- New Limits of Treewidth-based tractability in Optimization.
Faenza Y., Muñoz G. and Pokutta S. Online first, Mathematical Programming, 2020. - Outer-Product-Free Sets for Polynomial Optimization and Oracle-Based Cuts.
Bienstock D., Chen C. and Muñoz G. Mathematical Programming, 183, pp. 105–148, 2020. - Production scheduling for strategic open pit mine planning: A mixed-integer programming approach.
Rivera O., Espinoza D., Goycoolea M., Moreno E. and Muñoz G. Operations Research, 68(5), 1425-1444, 2020. - LP formulations for polynomial optimization problems.
Bienstock D. and Muñoz G. SIAM Journal on Optimization 28 (2), pp. 1121-1150, 2018. - A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Scheduling.
Muñoz G., Espinoza D., Goycoolea M., Moreno E., Queyranne M. and Rivera O. Computational Optimization and Applications, 69(2), pp. 501-534, 2018.
Conference Proceedings
- On the implementation and strengthening of intersection cuts for QCQPs.
Chmiela A., Muñoz G. and Serrano F. Accepted in IPCO 2021. - Maximal Quadratic-free Sets.
Muñoz G. and Serrano F. Integer Programming and Combinatorial Optimization. IPCO 2020. Lecture Notes in Computer Science, vol 12125. - On Generalized Surrogate Duality in Mixed-Integer Non-Linear Programming.
Müller B., Muñoz G., Gasse M., Gleixner A., Lodi A. and Serrano F. Integer Programming and Combinatorial Optimization. IPCO 2020. Lecture Notes in Computer Science, vol 12125. - Intersection Cuts for Polynomial Optimization.
Bienstock D., Chen C. and Muñoz G. Integer Programming and Combinatorial Optimization. IPCO 2019. Lecture Notes in Computer Science, vol 11480. Code can be found HERE - Sinkhorn Networks: Using Optimal Transport Techniques to Learn Permutations.
Mena G., Belanger D., Muñoz G. and Snoek J. NIPS Workshop in Optimal Transport and Machine Learning, 2017. - Robust optimization of power network operation: storage devices and the role of forecast errors in renewable energies.
Matke C., Bienstock D., Muñoz G., Yang S., Kleinhans D. and Sager S. Complex Networks & Their Applications V. Studies in Computational Intelligence, vol 693, pp. 809-820, 2017. - Approximate method for AC transmission switching based on a simple relaxation for AC-OPF problems.
Bienstock D. and Muñoz G. Power & Energy Society General Meeting, IEEE pp. 1-5, July 2015. - Open Pit Mine Scheduling under uncertainty: a robust approach.
Espinoza D., Goycoolea M., Moreno E., Muñoz G., and Queyranne M. APCOM 2013 – Applications of Computers and Operations Research in the Mineral Industry, pp. 433-444, 2013.
Ph.D. Thesis
- Integer programming techniques for Polynomial Optimization. Columbia University Academic Commons, 2017.
Engineering Degree Thesis
- Linear Integer Programming Models and Applications in Mining (in Spanish). Academic Repository Universidad de Chile, 2012.
