| Publication | Date of Publication | Type |
|---|
Optimizing over path-length matrices of unrooted binary trees
Mathematical Programming. Series A. Series B | 2026-01-16 | Paper |
| A dynamic programming approach for the job sequencing and tool switching problem | 2025-11-19 | Paper |
Deep reinforcement learning for inventory optimization with non-stationary uncertain demand
European Journal of Operational Research | 2024-04-16 | Paper |
Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey
European Journal of Operational Research | 2023-07-10 | Paper |
A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
Computers & Operations Research | 2023-07-03 | Paper |
On the exact separation of cover inequalities of maximum-depth
Optimization Letters | 2022-03-15 | Paper |
A tutorial on the balanced minimum evolution problem
European Journal of Operational Research | 2022-03-11 | Paper |
A new fast and accurate heuristic for the automatic scene detection problem
Computers & Operations Research | 2022-03-09 | Paper |
On the balanced minimum evolution polytope
Discrete Optimization | 2020-07-30 | Paper |
An information theory perspective on the balanced minimum evolution problem
Operations Research Letters | 2020-05-26 | Paper |
Enumerating vertices of the balanced minimum evolution polytope
Computers & Operations Research | 2019-07-09 | Paper |
A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
4OR | 2019-06-21 | Paper |
An integer linear programming formulation for the minimum cardinality segmentation problem
Algorithms | 2019-03-26 | Paper |
Max point-tolerance graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
A branch-price-and-cut algorithm for the minimum evolution problem
European Journal of Operational Research | 2016-10-06 | Paper |
Improved integer linear programming formulations for the job sequencing and tool switching problem
European Journal of Operational Research | 2016-10-06 | Paper |
The balanced minimum evolution problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
The balanced minimum evolution problem under uncertain data
Discrete Applied Mathematics | 2014-04-22 | Paper |
A class representative model for pure parsimony haplotyping
INFORMS Journal on Computing | 2012-07-28 | Paper |
Reduction approaches for robust shortest path problems
Computers & Operations Research | 2011-04-28 | Paper |
A branch-and-cut algorithm for the partitioning-hub location-routing problem
Computers & Operations Research | 2010-10-15 | Paper |
The pure parsimony haplotyping problem: overview and computational advances
International Transactions in Operational Research | 2010-05-31 | Paper |
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
Networks | 2009-07-28 | Paper |
The minimum evolution problem: Overview and classification
Networks | 2009-07-28 | Paper |
