Diego Cattaruzza
Orcid: 0000-0002-1814-2547
According to our database1,
Diego Cattaruzza
authored at least 27 papers
between 2014 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem.
Int. Trans. Oper. Res., January, 2025
2024
Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems.
INFORMS J. Comput., 2024
Eur. J. Oper. Res., 2024
Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem.
Eur. J. Oper. Res., 2024
The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm.
CoRR, 2024
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTW.
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
Improving MOEA/D with Knowledge Discovery. Application to a Bi-objective Routing Problem.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2023
2022
EURO J. Transp. Logist., 2022
Comput. Ind. Eng., 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022
New Neighborhood Strategies for the Bi-objective Vehicle Routing Problem with Time Windows.
Proceedings of the Metaheuristics - 14th International Conference, 2022
2021
Mixed integer programming formulations for the generalized traveling salesman problem with time windows.
4OR, 2021
2020
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing.
Transp. Sci., 2020
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows.
Oper. Res. Lett., 2020
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows.
Eur. J. Oper. Res., 2020
An efficient and general approach for the joint order batching and picker routing problem.
Eur. J. Oper. Res., 2020
EURO J. Transp. Logist., 2020
2019
Comput. Oper. Res., 2019
2017
Ann. Oper. Res., 2017
2016
Transp. Sci., 2016
2014
Eur. J. Oper. Res., 2014
An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows.
Comput. Oper. Res., 2014