| Publication | Date of Publication | Type |
|---|
| Bi-dimensional assignment in 5G periodic scheduling | 2024-10-16 | Paper |
Lagrangian matheuristics for the quadratic multiple knapsack problem
Discrete Applied Mathematics | 2023-05-15 | Paper |
A MILP approach to DRAM access worst-case analysis
Computers & Operations Research | 2022-06-22 | Paper |
A separation algorithm for the simple plant location problem
Operations Research Letters | 2021-12-13 | Paper |
| A Lagrangian approach to chance constrained routing with local broadcast | 2021-12-08 | Paper |
Valid inequalities for quadratic optimisation with domain constraints
Discrete Optimization | 2021-10-19 | Paper |
Optimization methods: an applications-oriented primer
Analytics for the Sharing Economy: Mathematics, Engineering and Business Perspectives | 2021-10-05 | Paper |
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
European Journal of Operational Research | 2021-06-07 | Paper |
A binarisation heuristic for non-convex quadratic programming with box constraints
Operations Research Letters | 2020-02-10 | Paper |
Delay-constrained routing problems: accurate scheduling models and admission control
Computers & Operations Research | 2018-07-11 | Paper |
On the Lovász theta function and some variants
Discrete Optimization | 2018-05-24 | Paper |
New valid inequalities and facets for the simple plant location problem
European Journal of Operational Research | 2018-05-17 | Paper |
Delay-constrained shortest paths: approximation algorithms and second-order cone models
Journal of Optimization Theory and Applications | 2015-05-11 | Paper |
Delay-robust event scheduling
Operations Research | 2014-08-11 | Paper |
A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
Optimization Letters | 2014-04-30 | Paper |
Gap inequalities for the max-cut problem: a cutting-plane algorithm
Lecture Notes in Computer Science | 2012-11-02 | Paper |
| Robust train routing and online re-scheduling | 2012-09-28 | Paper |
| Recoverable robustness for railway rolling stock planning | 2012-09-28 | Paper |
| 04. Solution of the train platforming problem | 2012-09-28 | Paper |
Complexity results for the gap inequalities for the max-cut problem
Operations Research Letters | 2012-08-17 | Paper |
Gap inequalities for non-convex mixed-integer quadratic programs
Operations Research Letters | 2012-04-05 | Paper |
Combinatorial and robust optimisation models and algorithms for railway applications
4OR | 2011-06-30 | Paper |
Small bipartite subgraph polytopes
Operations Research Letters | 2010-12-20 | Paper |
Strong formulations for the multi-module PESP and a quadratic algorithm for graphical Diophantine equation systems
Algorithms – ESA 2010 | 2010-09-06 | Paper |
An electromagnetism metaheuristic for the unicost set covering problem
European Journal of Operational Research | 2010-06-11 | Paper |
