| Publication | Date of Publication | Type |
|---|
| Relaxations and cutting planes for linear programs with complementarity constraints | 2024-09-17 | Paper |
| On the complexity of separating cutting planes for the knapsack polytope | 2024-08-20 | Paper |
| New classes of facets for complementarity knapsack problems | 2024-08-09 | Paper |
| A Set-Covering Approach to Customized Coverage Instrumentation | 2024-03-26 | Paper |
| An Integer Programming Approach To Subspace Clustering With Missing Data | 2023-09-26 | Paper |
| New classes of facets for complementarity knapsack problems | 2023-08-03 | Paper |
| Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation | 2023-03-14 | Paper |
| On the complexity of separation from the knapsack polytope | 2022-08-16 | Paper |
| Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints | 2022-08-02 | Paper |
| Optimization-based dispatching policies for open-pit mining | 2022-04-22 | Paper |
| MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library | 2021-12-27 | Paper |
| Multi-cover inequalities for totally-ordered multiple knapsack sets | 2021-12-21 | Paper |
| Minotaur: a mixed-integer nonlinear optimization toolkit | 2021-12-16 | Paper |
| Integer packing sets form a well-quasi-ordering | 2021-04-07 | Paper |
| Piecewise polyhedral formulations for a multilinear term | 2021-04-07 | Paper |
| Strong Convex Nonlinear Relaxations of the Pooling Problem | 2020-06-22 | Paper |
| Piecewise Polyhedral Formulations for a Multilinear Term | 2020-01-02 | Paper |
| Integer packing sets form a well-quasi-ordering | 2019-11-28 | Paper |
| Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods | 2018-11-09 | Paper |
| Valid inequalities for separable concave constraints with indicator variables | 2018-10-26 | Paper |
| Lift-and-project cuts for convex mixed integer nonlinear programs | 2018-02-21 | Paper |
| A cycle-based formulation and valid inequalities for DC power transmission problems with switching | 2016-10-31 | Paper |
| Valid Inequalities for Separable Concave Constraints with Indicator Variables | 2016-08-10 | Paper |
| Mixed-integer nonlinear optimization | 2014-06-11 | Paper |
| Locally ideal formulations for piecewise linear functions with indicator variables | 2014-05-15 | Paper |
| On valid inequalities for quadratic programming with continuous variables and binary indicators | 2013-03-19 | Paper |
| Some results on the strength of relaxations of multilinear functions | 2012-12-19 | Paper |
| FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs | 2012-07-28 | Paper |
| Improving bounds on the football pool problem by integer programming and high-throughput computing | 2012-07-28 | Paper |
| Algorithms and Software for Convex Mixed Integer Nonlinear Programs | 2012-07-10 | Paper |
| Perspective reformulation and applications | 2012-07-10 | Paper |
| A parallel, linear programming-based heuristic for large-scale set partitioning problems | 2012-05-30 | Paper |
| Disjunctive cuts for mixed integer nonlinear programming problems | 2012-01-26 | Paper |
| Solving large Steiner Triple Covering Problems | 2011-08-09 | Paper |
| Valid Inequalities for the Pooling Problem with Binary Variables | 2011-06-24 | Paper |
| A probing algorithm for MINLP with failure prediction by SVM | 2011-05-26 | Paper |
| Orbital branching | 2011-02-14 | Paper |
| Perspective reformulations of mixed integer nonlinear programs with indicator variables | 2010-09-16 | Paper |
| Reformulation and sampling to solve a stochastic network interdiction problem | 2009-10-21 | Paper |
| Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables | 2008-06-10 | Paper |
| Constraint Orbital Branching | 2008-06-10 | Paper |
| Orbital Branching | 2007-11-29 | Paper |
| The empirical behavior of sampling methods for stochastic programming | 2006-10-11 | Paper |
| Computational grids for stochastic programming | 2006-02-20 | Paper |
| A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs | 2005-06-14 | Paper |
| Decomposition algorithms for stochastic programming on a computational grid | 2003-04-03 | Paper |
| Solving large quadratic assignment problems on computational grids | 2002-12-01 | Paper |
| FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver | 2002-03-26 | Paper |
| A branch and cut approach to the cardinality constrained circuit problem. | 2002-01-01 | Paper |
| A Computational Study of Search Strategies for Mixed Integer Programming | 1999-01-01 | Paper |
