| Publication | Date of Publication | Type |
|---|
Political districting to optimize the Polsby-Popper compactness score with application to voting rights
Operations Research | 2025-11-11 | Paper |
| Convex envelopes of bounded monomials on two-variable cones | 2023-08-24 | Paper |
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
INFORMS Journal on Computing | 2020-11-09 | Paper |
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
INFORMS Journal on Computing | 2020-11-09 | Paper |
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation | 2019-12-19 | Paper |
Models for production planning under power interruptions
Naval Research Logistics | 2019-03-26 | Paper |
Fathoming rules for biobjective mixed integer linear programs: review and extensions
Discrete Optimization | 2018-05-24 | Paper |
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
Discrete Optimization | 2018-05-24 | Paper |
Three ideas for a feasibility pump for nonconvex MINLP
Optimization Letters | 2017-06-29 | Paper |
On handling indicator constraints in mixed integer programming
Computational Optimization and Applications | 2016-12-15 | Paper |
Convex hull characterizations of lexicographic orderings
Journal of Global Optimization | 2016-10-25 | Paper |
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
European Journal of Operational Research | 2016-10-07 | Paper |
A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
Top | 2016-06-30 | Paper |
A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
Numerical Analysis and Optimization | 2016-01-05 | Paper |
On the Composition of Convex Envelopes for Quadrilinear Terms
Optimization, Simulation, and Control | 2015-03-30 | Paper |
Efficient storage of Pareto points in biobjective mixed integer programming
(available as arXiv preprint) | 2014-11-24 | Paper |
Mixed-integer nonlinear optimization
Acta Numerica | 2014-06-11 | Paper |
On families of quadratic surfaces having fixed intersections with two hyperplanes
Discrete Applied Mathematics | 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
Optimization and Engineering | 2013-10-24 | Paper |
Bound reduction using pairs of linear inequalities
Journal of Global Optimization | 2013-08-01 | Paper |
Rounding-based heuristics for nonconvex MINLPS
Mathematical Programming Computation | 2012-11-27 | Paper |
Linear programming relaxations of quadratically constrained quadratic programs
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
Disjunctive Cuts for Nonconvex MINLP
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A probing algorithm for MINLP with failure prediction by SVM
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Feasibility-based bounds tightening via fixed points
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Optimal oblivious routing under linear and ellipsoidal uncertainty
Optimization and Engineering | 2009-11-23 | Paper |
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software | 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
4OR | 2008-05-20 | Paper |
Multi-layer MPLS network design: The impact of statistical multiplexing
Computer Networks | 2008-05-14 | Paper |
New formulations for the Kissing Number Problem
Discrete Applied Mathematics | 2007-09-19 | Paper |
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Virtual Private Network Design Under Traffic Uncertainty
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Network design with grooming constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Optimizing base station location and configuration in UMTS networks
Annals of Operations Research | 2007-02-05 | Paper |
Provisioning virtual private networks under traffic uncertainty
Networks | 2007-02-02 | Paper |
Multicommodity network design with discrete node costs
Networks | 2007-02-02 | Paper |
Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis)
4OR | 2005-08-25 | Paper |
