Gonzalo Muñoz

Orcid: 0000-0002-9003-441X

Affiliations:
  • Universidad de O'Higgins, Rancagua, Chile
  • Columbia University, NY, USA (Ph.D., 2017)


According to our database1, Gonzalo Muñoz authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decision-Focused Predictions via Pessimistic Bilevel Optimization: A Computational Study.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2023
Principled deep neural network training through linear programming.
Discret. Optim., August, 2023

On the implementation and strengthening of intersection cuts for QCQPs.
Math. Program., February, 2023

Computational Tradeoffs of Optimization-Based Bound Tightening in ReLU Networks.
CoRR, 2023

When Deep Learning Meets Polyhedral Theory: A Survey.
CoRR, 2023

Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Compressing Branch-and-Bound Trees.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Towards a Characterization of Maximal Quadratic-Free Sets.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Monoidal Strengthening and Unique Lifting in MIQCPs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations.
SIAM J. Optim., 2022

Cutting Plane Generation through Sparse Principal Component Analysis.
SIAM J. Optim., 2022

Convex envelopes for ray-concave functions.
Optim. Lett., 2022

Exact reliability optimization for series-parallel graphs using convex envelopes.
Networks, 2022

Maximal quadratic-free sets.
Math. Program., 2022

On generalized surrogate duality in mixed-integer nonlinear programming.
Math. Program., 2022

New limits of treewidth-based tractability in optimization.
Math. Program., 2022

2020
Outer-product-free sets for polynomial optimization and oracle-based cuts.
Math. Program., 2020

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach.
Oper. Res., 2020

2019
Intersection Cuts for Polynomial Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
LP Formulations for Polynomial Optimization Problems.
SIAM J. Optim., 2018

Limits of Treewidth-based tractability in Optimization.
CoRR, 2018

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling.
Comput. Optim. Appl., 2018

2017
Robust linear control of storage in transmission systems, and extensions to robust network control problems.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016
Robust optimization of power network operation: storage devices and the role of forecast errors in renewable energies.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2015
LP approximations to mixed-integer polynomial optimization problems.
CoRR, 2015


  Loading...