| Publication | Date of Publication | Type |
|---|
A Numerically Exact Algorithm for the Bin-Packing Problem
INFORMS Journal on Computing | 2024-03-26 | Paper |
Energy storage operation and electricity market design: on the market power of monopolistic storage operators
European Journal of Operational Research | 2023-07-04 | Paper |
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
INFORMS Journal on Computing | 2022-06-30 | Paper |
On the exact separation of cover inequalities of maximum-depth
Optimization Letters | 2022-03-15 | Paper |
A unified framework for multistage mixed integer linear optimization
Bilevel Optimization | 2021-12-08 | Paper |
Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets
OR Spectrum | 2021-11-09 | Paper |
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
European Journal of Operational Research | 2021-06-03 | Paper |
Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
Algorithmica | 2020-04-01 | Paper |
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
EURO Journal on Computational Optimization | 2020-03-25 | Paper |
A lexicographic pricer for the fractional bin packing problem
Operations Research Letters | 2020-02-10 | Paper |
Leadership in singleton congestion games: what is hard and what is easy
Artificial Intelligence | 2020-01-20 | Paper |
Leadership in singleton congestion games: what is hard and what is easy
Artificial Intelligence | 2020-01-20 | Paper |
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
European Journal of Operational Research | 2019-06-25 | Paper |
Lot sizing with storage losses under demand uncertainty
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
| Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria | 2018-08-13 | Paper |
| On the separation of topology-free rank inequalities for the max stable set problem | 2018-08-13 | Paper |
On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Discrete optimization methods to fit piecewise affine models to data points
Computers & Operations Research | 2016-11-17 | Paper |
| On the computational complexity of the virtual network embedding problem | 2016-10-18 | Paper |
Maximum throughput network routing subject to fair flow allocation
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
European Journal of Operational Research | 2014-07-27 | Paper |
Coordinated cutting plane generation via multi-objective separation
Mathematical Programming. Series A. Series B | 2014-02-25 | Paper |
