| Publication | Date of Publication | Type |
|---|
Relaxations and cutting planes for linear programs with complementarity constraints
Journal of Global Optimization | 2024-09-17 | Paper |
On the complexity of separating cutting planes for the knapsack polytope
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
New classes of facets for complementarity knapsack problems
Discrete Applied Mathematics | 2024-08-09 | Paper |
A Set-Covering Approach to Customized Coverage Instrumentation
INFORMS Journal on Computing | 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
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
On the complexity of separation from the knapsack polytope
(available as arXiv preprint) | 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
Optimization and Engineering | 2022-04-22 | Paper |
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
Mathematical Programming Computation | 2021-12-27 | Paper |
Multi-cover inequalities for totally-ordered multiple knapsack sets
(available as arXiv preprint) | 2021-12-21 | Paper |
Minotaur: a mixed-integer nonlinear optimization toolkit
Mathematical Programming Computation | 2021-12-16 | Paper |
Integer packing sets form a well-quasi-ordering
Operations Research Letters | 2021-04-07 | Paper |
Piecewise polyhedral formulations for a multilinear term
Operations Research Letters | 2021-04-07 | Paper |
Strong convex nonlinear relaxations of the pooling problem
SIAM Journal on Optimization | 2020-06-22 | Paper |
Piecewise Polyhedral Formulations for a Multilinear Term
(available as arXiv preprint) | 2020-01-02 | Paper |
Integer packing sets form a well-quasi-ordering
(available as arXiv preprint) | 2019-11-28 | Paper |
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
Mathematical Programming Computation | 2018-11-09 | Paper |
Valid inequalities for separable concave constraints with indicator variables
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Lift-and-project cuts for convex mixed integer nonlinear programs
Mathematical Programming Computation | 2018-02-21 | Paper |
A cycle-based formulation and valid inequalities for DC power transmission problems with switching
Operations Research | 2016-10-31 | Paper |
Valid inequalities for separable concave constraints with indicator variables
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Mixed-integer nonlinear optimization
Acta Numerica | 2014-06-11 | Paper |
Locally ideal formulations for piecewise linear functions with indicator variables
Operations Research Letters | 2014-05-15 | Paper |
On valid inequalities for quadratic programming with continuous variables and binary indicators
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Some results on the strength of relaxations of multilinear functions
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Improving bounds on the football pool problem by integer programming and high-throughput computing
INFORMS Journal on Computing | 2012-07-28 | Paper |
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
Perspective reformulation and applications
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
A parallel, linear programming-based heuristic for large-scale set partitioning problems
INFORMS Journal on Computing | 2012-05-30 | Paper |
| Disjunctive cuts for mixed integer nonlinear programming problems | 2012-01-26 | Paper |
Solving large Steiner Triple Covering Problems
Operations Research Letters | 2011-08-09 | Paper |
Valid Inequalities for the Pooling Problem with Binary Variables
Integer Programming and Combinatoral Optimization | 2011-06-24 | 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 |
Orbital branching
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Reformulation and sampling to solve a stochastic network interdiction problem
Networks | 2009-10-21 | Paper |
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Constraint Orbital Branching
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Orbital Branching
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
The empirical behavior of sampling methods for stochastic programming
Annals of Operations Research | 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
Mathematical Programming. Series A. Series B | 2005-06-14 | Paper |
Decomposition algorithms for stochastic programming on a computational grid
Computational Optimization and Applications | 2003-04-03 | Paper |
Solving large quadratic assignment problems on computational grids
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
Annals of Operations Research | 2002-03-26 | Paper |
A branch and cut approach to the cardinality constrained circuit problem.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
A Computational Study of Search Strategies for Mixed Integer Programming
INFORMS Journal on Computing | 1999-01-01 | Paper |
