A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. - Federico Della Croce; Michele Garraffa; Fabio Salassa (ISCO, 2014)

The Selective Fixing Algorithm for the closest string problem. - Federico Della Croce; Michele Garraffa (Comput. Oper. Res., 2014)

A hybrid three-phase approach for the Max-Mean Dispersion Problem. - Federico Della Croce; Michele Garraffa; Fabio Salassa (Comput. Oper. Res., 2016)

The one-dimensional cutting stock problem with sequence-dependent cut losses. - Michele Garraffa; Fabio Salassa; Wim Vancroonenburg; Greet Vanden Berghe; Tony Wauters (Int. Trans. Oper. Res., 2016)

Assessment of multi-UAVs tracking for data gathering. - Mustapha Bekhti; Michele Garraffa; Nadjib Achir; Khaled Boussetta; Lucas Létocart (IWCMC, 2017)

Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. - Lei Shang 001; Michele Garraffa; Federico Della Croce; Vincent T'kindt (IPEC, 2017)

Heuristic approaches for a domestic energy management system. - Federico Della Croce; Michele Garraffa; Fabio Salassa; Claudio Borean; Giuseppe Di Bella; Ennio Grasso (Comput. Ind. Eng., 2017)

An exact semidefinite programming approach for the max-mean dispersion problem. - Michele Garraffa; Federico Della Croce; Fabio Salassa (J. Comb. Optim., 2017)

Drones path planning for WSN data gathering: A column generation heuristic approach. - Michele Garraffa; Mustapha Bekhti; Lucas Létocart; Nadjib Achir; Khaled Boussetta (WCNC, 2018)

An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. - Michele Garraffa; Lei Shang 001; Federico Della Croce; Vincent T'kindt (Theor. Comput. Sci., 2018)

Simulation-Based Optimization Tool for Field Service Planning. - Gabriel G. Castañé; Helmut Simonis; Kenneth N. Brown; Yiqing Lin; Cemalettin Ozturk; Michele Garraffa; Mark Antunes (WSC, 2019)

Resource Aware Multifidelity Active Learning for Efficient Optimization. - Francesco Grassi; Giorgio Manganini; Michele Garraffa; Laura Mainini (CoRR, 2020)

The Hybrid Flexible Flowshop with Transportation Times. - Eddie Armstrong; Michele Garraffa; Barry O'Sullivan; Helmut Simonis (CP, 2021)

An adaptive large neighbourhood search algorithm for diameter bounded network design problems. - Michele Garraffa; Deepak Mehta 001; Barry O'Sullivan; Cemalettin Ozturk; Luis Quesada 001 (J. Heuristics, 2021)

A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times. - Eddie Armstrong; Michele Garraffa; Barry O'Sullivan; Helmut Simonis (CPAIOR, 2022)

A multi-objective supplier selection framework based on user-preferences. - Federico Toffano; Michele Garraffa; Yiqing Lin; Steven D. Prestwich; Helmut Simonis; Nic Wilson (Ann. Oper. Res., 2022)

MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem. - Andrea Balogh; Michele Garraffa; Barry O'Sullivan; Fabio Salassa (Comput. Oper. Res., 2022)

Permutation flowshop problems minimizing core waiting time and core idle time. - Arianna Alfieri; Michele Garraffa; Erica Pastore; Fabio Salassa (Comput. Ind. Eng., 2023)

Decomposition heuristics for the Hybrid Flexible Flowshop with transportation times. - Michele Garraffa; Helmut Simonis; Barry O'Sullivan; Eddie Armstrong (Comput. Oper. Res., 2025)