| Publication | Date of Publication | Type |
|---|
Extending an integer formulation for the guillotine 2D bin packing problem
Procedia Computer Science | 2025-12-02 | Paper |
A biased random‐key genetic algorithm for the home health care problem
International Transactions in Operational Research | 2024-01-31 | Paper |
| Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem | 2023-08-09 | Paper |
Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Mathematical Programming Computation | 2022-11-24 | Paper |
A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
Computers & Operations Research | 2022-03-09 | Paper |
Enhanced Formulation for Guillotine 2D Cutting Problems
(available as arXiv preprint) | 2021-11-11 | Paper |
An integer programming approach for the physician rostering problem
Annals of Operations Research | 2021-11-08 | Paper |
A study on the pickup and delivery problem with time windows: matheuristics and new instances
Computers & Operations Research | 2021-04-20 | Paper |
Hybrid algorithms for placement of virtual machines across geo-separated data centers
Journal of Combinatorial Optimization | 2019-10-29 | Paper |
An empirical analysis of exact algorithms for the unbounded knapsack problem
European Journal of Operational Research | 2019-03-28 | Paper |
A column generation approach to high school timetabling modeled as a multicommodity flow problem
European Journal of Operational Research | 2018-05-24 | Paper |
A branch-and-price algorithm for the single-path virtual network embedding problem
Networks | 2018-04-27 | Paper |
| A relax-and-fix algorithm for a maritime inventory routing problem | 2018-01-25 | Paper |
On the minimization of traffic congestion in road networks with tolls
Annals of Operations Research | 2017-03-07 | Paper |
An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks
Computers & Operations Research | 2016-11-11 | Paper |
A fix-and-optimize heuristic for the high school timetabling problem
Computers & Operations Research | 2016-11-10 | Paper |
Simulated annealing for the machine reassignment problem
Annals of Operations Research | 2016-11-07 | Paper |
\textsc{Pull} and \textsc{PushPull} are PSPACE-complete
Theoretical Computer Science | 2016-04-13 | Paper |
Optimal Sokoban solving using pattern databases with specific domain knowledge
Artificial Intelligence | 2015-12-21 | Paper |
| On the smoothed price of anarchy of the traffic assignment problem | 2012-09-28 | Paper |
Speeding up dynamic shortest-path algorithms
INFORMS Journal on Computing | 2012-07-28 | Paper |
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
International Transactions in Operational Research | 2011-08-17 | Paper |
A biased random-key genetic algorithm for road congestion minimization
Optimization Letters | 2010-10-29 | Paper |
Estimating Clustering Indexes in Data Streams
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Survivable IP network design with OSPF routing
Networks | 2007-02-02 | Paper |
A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
Networks | 2005-09-22 | Paper |
A new memetic algorithm for the asymmetric traveling salesman problem
Journal of Heuristics | 2005-04-07 | Paper |
