Michele Garraffa
Orcid: 0000-0002-1886-8073
According to our database1,
Michele Garraffa
authored at least 18 papers
between 2014 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
0
1
2
3
4
5
1
2
1
1
1
2
2
1
1
1
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Comput. Ind. Eng., February, 2023
2022
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem.
Comput. Oper. Res., 2022
Ann. Oper. Res., 2022
A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022
2021
An adaptive large neighbourhood search algorithm for diameter bounded network design problems.
J. Heuristics, 2021
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021
2020
2019
Proceedings of the 2019 Winter Simulation Conference, 2019
2018
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem.
Theor. Comput. Sci., 2018
Proceedings of the 2018 IEEE Wireless Communications and Networking Conference, 2018
2017
J. Comb. Optim., 2017
Comput. Ind. Eng., 2017
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017
2016
Int. Trans. Oper. Res., 2016
Comput. Oper. Res., 2016
2014
Comput. Oper. Res., 2014
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014