The following pages link to Gonzalo Muñoz (Q1744893):
Displaying 17 items.
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling (Q1744895) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Intersection cuts for polynomial optimization (Q2293083) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach (Q5144773) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Principled deep neural network training through linear programming (Q6054389) (← links)
- Exact reliability optimization for series‐parallel graphs using convex envelopes (Q6066247) (← links)
