| Publication | Date of Publication | Type |
|---|
A trust-region framework for derivative-free mixed-integer optimization
Mathematical Programming Computation | 2024-11-29 | Paper |
Convex optimization under combinatorial sparsity constraints
Operations Research Letters | 2022-12-12 | Paper |
Robustness of solutions to the capacitated facility location problem with uncertain demand
Optimization Letters | 2022-11-01 | Paper |
Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
Computers & Operations Research | 2022-06-22 | Paper |
Deterministic policies based on maximum regrets in MDPs with imprecise rewards
AI Communications | 2022-04-19 | Paper |
Dantzig-Wolfe reformulations for binary quadratic problems
Mathematical Programming Computation | 2022-04-14 | Paper |
| Branch and Price for Submodular Bin Packing | 2022-04-01 | Paper |
A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs
Mathematical Programming Computation | 2022-01-10 | Paper |
A constraints-aware reweighted feasibility pump approach
Operations Research Letters | 2021-12-13 | Paper |
Quadratic Combinatorial Optimization Using Separable Underestimators
INFORMS Journal on Computing | 2020-11-25 | Paper |
An exact algorithm for robust influence maximization
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
Computational Optimization and Applications | 2020-02-28 | Paper |
An exact algorithm for robust influence maximization
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Theoretical and computational study of several linearisation techniques for binary quadratic problems
Annals of Operations Research | 2020-01-20 | Paper |
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation | 2019-12-19 | Paper |
| A Julia Module for Polynomial Optimization with Complex Variables applied to Optimal Power Flow | 2019-04-18 | Paper |
On the product knapsack problem
Optimization Letters | 2018-08-03 | Paper |
Exact approaches for the knapsack problem with setups
Computers & Operations Research | 2018-07-11 | Paper |
| Optimal Solution of Vehicle Routing Problems with Fractional Objective Function | 2018-04-09 | Paper |
| A simplicial decomposition framework for large scale convex quadratic programming | 2017-05-25 | Paper |
Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
Information Processing Letters | 2016-03-01 | Paper |
On the separation of split inequalities for non-convex quadratic integer programming
Discrete Optimization | 2015-04-09 | Paper |
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
Optimal linear arrangements using betweenness variables
Mathematical Programming Computation | 2012-11-27 | Paper |
Partial convexification of general mips by Dantzig-Wolfe reformulation
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
