LP approximations to mixed-integer polynomial optimization problems. - Daniel Bienstock; Gonzalo Muñoz 001 (CoRR, 2015)

Robust optimization of power network operation: storage devices and the role of forecast errors in renewable energies. - Carsten Matke; Daniel Bienstock; Gonzalo Muñoz 001; Shuoguang Yang; David Kleinhans; Sebastian Sager (COMPLEX NETWORKS, 2016)

Robust linear control of storage in transmission systems, and extensions to robust network control problems. - Daniel Bienstock; Gonzalo Muñoz 001; Shuoguang Yang; Carsten Matke (CDC, 2017)

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. - Gonzalo Muñoz 001; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Maurice Queyranne; Orlando Rivera Letelier (Comput. Optim. Appl., 2018)

Limits of Treewidth-based tractability in Optimization. - Yuri Faenza; Gonzalo Muñoz 001; Sebastian Pokutta (CoRR, 2018)

LP Formulations for Polynomial Optimization Problems. - Daniel Bienstock; Gonzalo Muñoz 001 (SIAM J. Optim., 2018)

Intersection Cuts for Polynomial Optimization. - Daniel Bienstock; Chen Chen 026; Gonzalo Muñoz 001 (IPCO, 2019)

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. - Orlando Rivera Letelier; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Gonzalo Muñoz 001 (Oper. Res., 2020)

Outer-product-free sets for polynomial optimization and oracle-based cuts. - Daniel Bienstock; Chen Chen 026; Gonzalo Muñoz 001 (Math. Program., 2020)

New limits of treewidth-based tractability in optimization. - Yuri Faenza; Gonzalo Muñoz 001; Sebastian Pokutta (Math. Program., 2022)

On generalized surrogate duality in mixed-integer nonlinear programming. - Benjamin Müller 002; Gonzalo Muñoz 001; Maxime Gasse; Ambros M. Gleixner; Andrea Lodi 001; Felipe Serrano 001 (Math. Program., 2022)

Maximal quadratic-free sets. - Gonzalo Muñoz 001; Felipe Serrano 001 (Math. Program., 2022)

Exact reliability optimization for series-parallel graphs using convex envelopes. - Javiera Barrera; Eduardo Moreno 001; Gonzalo Muñoz 001; Pablo Romero (Networks, 2022)

Convex envelopes for ray-concave functions. - Javiera Barrera; Eduardo Moreno 001; Gonzalo Muñoz 001 (Optim. Lett., 2022)

Cutting Plane Generation through Sparse Principal Component Analysis. - Santanu S. Dey; Aleksandr M. Kazachkov; Andrea Lodi 001; Gonzalo Muñoz 001 (SIAM J. Optim., 2022)

On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations. - Santanu S. Dey; Gonzalo Muñoz 001; Felipe Serrano 001 (SIAM J. Optim., 2022)

Towards a Characterization of Maximal Quadratic-Free Sets. - Gonzalo Muñoz 001; Joseph Paat; Felipe Serrano 001 (IPCO, 2023)

When Deep Learning Meets Polyhedral Theory: A Survey. - Joey Huchette; Gonzalo Muñoz 001; Thiago Serra; Calvin Tsay (CoRR, 2023)

Computational Tradeoffs of Optimization-Based Bound Tightening in ReLU Networks. - Fabian Badilla; Marcos Goycoolea; Gonzalo Muñoz 001; Thiago Serra (CoRR, 2023)

On the implementation and strengthening of intersection cuts for QCQPs. - Antonia Chmiela; Gonzalo Muñoz 001; Felipe Serrano 001 (Math. Program., 2023)

Principled deep neural network training through linear programming. - Daniel Bienstock; Gonzalo Muñoz 001; Sebastian Pokutta (Discret. Optim., 2023)

Decision-Focused Predictions via Pessimistic Bilevel Optimization: A Computational Study. - Víctor Bucarey; Sophia Calderón; Gonzalo Muñoz 001; Frédéric Semet (CPAIOR (1), 2024)

The MIP Workshop 2023 Computational Competition on reoptimization. - Suresh Bolusani; Mathieu Besançon; Ambros M. Gleixner; Timo Berthold; Claudia D'Ambrosio; Gonzalo Muñoz 001; Joseph Paat; Dimitri Thomopulos (Math. Program. Comput., 2024)

Monoidal strengthening and unique lifting in MIQCPs. - Antonia Chmiela; Gonzalo Muñoz 001; Felipe Serrano 001 (Math. Program., 2025)

A characterization of maximal homogeneous-quadratic-free sets. - Gonzalo Muñoz 001; Joseph Paat; Felipe Serrano 001 (Math. Program., 2025)

Compressing branch-and-bound trees. - Gonzalo Muñoz 001; Joseph Paat; Álinson S. Xavier (Math. Program., 2025)

Exploiting the polyhedral geometry of stochastic linear bilevel programming. - Gonzalo Muñoz 001; David Salas; Anton Svensson (Math. Program., 2025)