| Publication | Date of Publication | Type |
|---|
Designing sustainable diet plans by solving triobjective integer programs
Mathematical Methods of Operations Research | 2025-01-09 | Paper |
On necessary optimality conditions for sets of points in multiobjective optimization
Journal of Optimization Theory and Applications | 2024-11-12 | Paper |
An oracle-based framework for robust combinatorial optimization
Journal of Global Optimization | 2024-01-26 | Paper |
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
4OR | 2023-10-26 | Paper |
Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient
Computational Optimization and Applications | 2022-10-04 | Paper |
On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
Operations Research Letters | 2022-07-22 | Paper |
A decision space algorithm for multiobjective convex quadratic integer optimization
Computers & Operations Research | 2022-03-09 | Paper |
Improving ADMMs for solving doubly nonnegative programs through dual factorization
4OR | 2021-11-04 | Paper |
| Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems | 2021-06-23 | Paper |
Solving multiobjective mixed integer convex optimization problems
SIAM Journal on Optimization | 2020-11-09 | Paper |
An active-set algorithmic framework for non-convex optimization problems over the simplex
Computational Optimization and Applications | 2020-07-29 | Paper |
An active set algorithm for robust combinatorial optimization based on separation oracles
Advances in Computational Mathematics | 2020-03-11 | Paper |
An active set algorithm for robust combinatorial optimization based on separation oracles
Mathematical Programming Computation | 2020-02-17 | Paper |
Using a factored dual in augmented Lagrangian methods for semidefinite programming
Operations Research Letters | 2020-02-10 | Paper |
Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
European Journal of Operational Research | 2020-01-23 | Paper |
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Operations Research Letters | 2018-09-28 | Paper |
A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
Journal of Global Optimization | 2018-03-13 | Paper |
A two-stage active-set algorithm for bound-constrained optimization
Journal of Optimization Theory and Applications | 2017-06-22 | Paper |
| Dual approaches for a specific class of integer nonlinear programming problems | 2017-02-14 | Paper |
A nonmonotone GRASP
Mathematical Programming Computation | 2016-11-11 | Paper |
A feasible active set method with reoptimization for convex quadratic mixed-integer programming
SIAM Journal on Optimization | 2016-09-02 | Paper |
A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
SIAM Journal on Optimization | 2016-03-30 | Paper |
Feasibility Pump-like heuristics for mixed integer problems
Discrete Applied Mathematics | 2014-05-05 | Paper |
A new class of functions for measuring solution integrality in the feasibility pump approach
SIAM Journal on Optimization | 2013-12-13 | Paper |
An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
SIAM Journal on Optimization | 2013-12-13 | Paper |
An active set feasible method for large-scale minimization problems with bound constraints
Computational Optimization and Applications | 2013-01-04 | Paper |
Continuous reformulations for zero-one programming problems
Journal of Optimization Theory and Applications | 2012-05-08 | Paper |
