| A variable neighborhood search based matheuristic for nurse rostering problems F Della Croce, F Salassa Annals of Operations Research 218 (1), 185-199, 2014 | 93 | 2014 |
| A distributed IoT infrastructure to test and deploy real-time demand response in smart grids L Barbierato, A Estebsari, E Pons, M Pau, F Salassa, M Ghirardi, E Patti IEEE Internet of Things Journal 6 (1), 1136-1146, 2018 | 84 | 2018 |
| A matheuristic approach for the two-machine total completion time flow shop problem F Della Croce, A Grosso, F Salassa Annals of Operations Research 213 (1), 67-78, 2014 | 45 | 2014 |
| An exact approach for the 0–1 knapsack problem with setups F Della Croce, F Salassa, R Scatamacchia Computers & Operations Research 80, 61-67, 2017 | 42 | 2017 |
| 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 | 31 | 2016 |
| A hybrid heuristic approach for single machine scheduling with release times F Della Croce, F Salassa, V T'kindt Computers & Operations Research 45, 7-11, 2014 | 29 | 2014 |
| Local and global constraint consistency in personnel rostering P Smet, F Salassa, G Vanden Berghe International Transactions in Operational Research 24 (5), 1099-1117, 2017 | 22 | 2017 |
| A matheuristic approach for the total completion time two-machines permutation flow shop problem F Della Croce, A Grosso, F Salassa Evolutionary Computation in Combinatorial Optimization: 11th European …, 2011 | 22 | 2011 |
| Minimizing total completion time in the two-machine no-idle no-wait flow shop problem F Della Croce, A Grosso, F Salassa Journal of Heuristics 27, 159-173, 2021 | 18 | 2021 |
| 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 |
| Structuring fragmented knowledge: a case study MF Norese, F Salassa Knowledge Management Research & Practice 12, 454-463, 2014 | 17 | 2014 |
| Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems F Della Croce, AC Grosso, F Salassa Heuristics: theory and applications, 31-52, 2013 | 16 | 2013 |
| A new exact approach for the 0–1 collapsing knapsack problem F Della Croce, F Salassa, R Scatamacchia European Journal of Operational Research 260 (1), 56-69, 2017 | 14 | 2017 |
| No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths JC Billaut, F Della Croce, F Salassa, V t’Kindt Journal of Scheduling 22, 59-68, 2019 | 13 | 2019 |
| A stepping horizon view on nurse rostering F Salassa, G Vanden Berghe Proceedings of the 9th international conference on the practice and theory …, 2012 | 13 | 2012 |
| Improved LP-based algorithms for the closest string problem F Della Croce, F Salassa Computers & operations research 39 (3), 746-749, 2012 | 13 | 2012 |
| 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 |
| 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 |
| Merging combinatorial design and optimization: the Oberwolfach problem F Salassa, G Dragotto, T Traetta, M Buratti, F Della Croce arXiv preprint arXiv:1903.12112, 2019 | 10 | 2019 |
| 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 |
Federico Della CroceDIGEP Politecnico di Torino, ItalyVerified email at polito.it
