| The one‐dimensional cutting stock problem with sequence‐dependent cut losses M Garraffa, F Salassa, W Vancroonenburg, G Vanden Berghe, T Wauters International Transactions in Operational Research 23 (1-2), 5-24, 2016 | 30 | 2016 |
| Drones path planning for WSN data gathering: A column generation heuristic approach M Garraffa, M Bekhti, L Létocart, N Achir, K Boussetta 2018 IEEE Wireless Communications and Networking Conference (WCNC), 1-6, 2018 | 20 | 2018 |
| A hybrid three-phase approach for the max-mean dispersion problem F Della Croce, M Garraffa, F Salassa Computers & Operations Research 71, 16-22, 2016 | 18 | 2016 |
| Heuristic approaches for a domestic energy management system F Della Croce, M Garraffa, F Salassa, C Borean, G Di Bella, E Grasso Computers & Industrial Engineering 109, 169-178, 2017 | 12 | 2017 |
| An exact exponential branch-and-merge algorithm for the single machine total tardiness problem M Garraffa, L Shang, F Della Croce, V T'kindt Theoretical Computer Science 745, 133-149, 2018 | 11 | 2018 |
| MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem A Balogh, M Garraffa, B O’Sullivan, F Salassa Computers & Operations Research 146, 105862, 2022 | 10 | 2022 |
| A multi-objective supplier selection framework based on user-preferences F Toffano, M Garraffa, Y Lin, S Prestwich, H Simonis, N Wilson Annals of Operations Research, 2021 | 10 | 2021 |
| Resource aware multifidelity active learning for efficient optimization F Grassi, G Manganini, M Garraffa, L Mainini AIAA scitech 2021 forum, 0894, 2021 | 9 | 2021 |
| An exact semidefinite programming approach for the max-mean dispersion problem M Garraffa, F Della Croce, F Salassa Journal of Combinatorial Optimization 34, 71-93, 2017 | 9 | 2017 |
| Simulation-based optimization tool for field service planning GG Castańé, H Simonis, KN Brown, Y Lin, C Ozturk, M Garraffa, ... 2019 Winter Simulation Conference (WSC), 1684-1695, 2019 | 7 | 2019 |
| A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem F Della Croce, M Garraffa, F Salassa International Symposium on Combinatorial Optimization, 186-197, 2014 | 6 | 2014 |
| The selective fixing algorithm for the closest string problem F Della Croce, M Garraffa Computers & operations research 41, 24-30, 2014 | 6 | 2014 |
| Permutation flowshop problems minimizing core waiting time and core idle time A Alfieri, M Garraffa, E Pastore, F Salassa Computers & Industrial Engineering 176, 108983, 2023 | 4 | 2023 |
| Assessment of multi-UAVs tracking for data gathering M Bekhti, M Garraffa, N Achir, K Boussetta, L Létocart 2017 13th International Wireless Communications and Mobile Computing …, 2017 | 4 | 2017 |
| Raal: Resource aware active learning for multifidelity efficient optimization F Grassi, G Manganini, M Garraffa, L Mainini AIAA Journal 61 (6), 2744-2753, 2023 | 3 | 2023 |
| An Exact Exponential Branch-and-Merge Algorithm for the Single Machine Total Tardiness Problem L Shang, M Garraffa, F Della Croce, V t'Kindt 16th International Conference on Project Management and Scheduling (PMS 16), 2016 | 3 | 2016 |
| A branch-and-reduce exact algorithm for the single machine total tardiness problem F DELLA CROCE DI DOJOLA, M Garraffa, L Shang, V t'Kindt Proceedings of the 7th Multidisciplinary International Scheduling Conference …, 2015 | 3 | 2015 |
| The hybrid flexible flowshop with transportation times E Armstrong, M Garraffa, B O'Sullivan, H Simonis 27th International Conference on Principles and Practice of Constraint …, 2021 | 2 | 2021 |
| Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem L Shang, M Garraffa, F Della Croce, V T'kindt 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018 | 2 | 2018 |
| Energy Efficient Manufacturing Scheduling: A Systematic Literature Review A Missaoui, C Ozturk, BO Sullivan, M Garraffa arXiv preprint arXiv:2308.13585, 2023 | | 2023 |
Fabio SalassaRicercatoreEmail verificata su polito.it
