| Publication | Date of Publication | Type |
|---|
| Convex envelopes of bounded monomials on two-variable cones | 2023-08-24 | Paper |
| Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming | 2020-11-09 | Paper |
| QPLIB: a library of quadratic programming instances | 2019-12-19 | Paper |
| Models for production planning under power interruptions | 2019-03-26 | Paper |
| Fathoming rules for biobjective mixed integer linear programs: review and extensions | 2018-05-24 | Paper |
| A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization | 2018-05-24 | Paper |
| Three ideas for a feasibility pump for nonconvex MINLP | 2017-06-29 | Paper |
| On handling indicator constraints in mixed integer programming | 2016-12-15 | Paper |
| Convex hull characterizations of lexicographic orderings | 2016-10-25 | Paper |
| Lower bounding procedure for the asymmetric quadratic traveling salesman problem | 2016-10-07 | Paper |
| A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) | 2016-06-30 | Paper |
| A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization | 2016-01-05 | Paper |
| On the Composition of Convex Envelopes for Quadrilinear Terms | 2015-03-30 | Paper |
| Efficient storage of Pareto points in biobjective mixed integer programming | 2014-11-24 | Paper |
| Mixed-integer nonlinear optimization | 2014-06-11 | Paper |
| On families of quadratic surfaces having fixed intersections with two hyperplanes | 2014-04-10 | Paper |
| Valid inequalities and convex hulls for multilinear functions | 2013-11-08 | Paper |
| OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty | 2013-10-24 | Paper |
| Bound reduction using pairs of linear inequalities | 2013-08-01 | Paper |
| Rounding-based heuristics for nonconvex MINLPS | 2012-11-27 | Paper |
| Linear Programming Relaxations of Quadratically Constrained Quadratic Programs | 2012-07-10 | Paper |
| Disjunctive Cuts for Nonconvex MINLP | 2012-07-10 | Paper |
| A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem | 2011-09-09 | Paper |
| A Probing Algorithm for MINLP with Failure Prediction by SVM | 2011-05-26 | Paper |
| Feasibility-Based Bounds Tightening via Fixed Points | 2011-01-08 | Paper |
| Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems | 2010-02-09 | Paper |
| Optimal oblivious routing under linear and ellipsoidal uncertainty | 2009-11-23 | Paper |
| Branching and bounds tighteningtechniques for non-convex MINLP | 2009-09-18 | Paper |
| A local branching heuristic for MINLPs | 2008-12-11 | Paper |
| A branch-and-cut method for the obnoxious \(p\)-median problem | 2008-05-20 | Paper |
| Multi-layer MPLS network design: The impact of statistical multiplexing | 2008-05-14 | Paper |
| New formulations for the Kissing Number Problem | 2007-09-19 | Paper |
| Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem | 2007-08-30 | Paper |
| Virtual Private Network Design Under Traffic Uncertainty | 2007-05-29 | Paper |
| Network design with grooming constraints | 2007-05-29 | Paper |
| Optimizing base station location and configuration in UMTS networks | 2007-02-05 | Paper |
| Provisioning virtual private networks under traffic uncertainty | 2007-02-02 | Paper |
| Multicommodity network design with discrete node costs | 2007-02-02 | Paper |
| Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis) | 2005-08-25 | Paper |
