Sabino Francesco Roselli

Orcid: 0000-0002-4845-3565

According to our database1, Sabino Francesco Roselli authored at least 10 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Conflict-free electric vehicle routing problem: an improved compositional algorithm.
Discret. Event Dyn. Syst., 2024

2022
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem.
IEEE Trans Autom. Sci. Eng., 2022

2021
On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering.
IEEE Trans Autom. Sci. Eng., 2021

Solving the Conflict-Free Electric Vehicle Routing Problem Using SMT Solvers.
Proceedings of the 29th Mediterranean Conference on Control and Automation, 2021

An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem.
Proceedings of the 17th IEEE International Conference on Automation Science and Engineering, 2021

2020
Compact Representation of Time-Index Job Shop Problems Using a Bit-Vector Formulation.
Proceedings of the 16th IEEE International Conference on Automation Science and Engineering, 2020

Comparison of Exact and Approximate methods for the Vehicle Routing Problem with Time Windows.
Proceedings of the 16th IEEE International Conference on Automation Science and Engineering, 2020

2019
On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering.
Proceedings of the 15th IEEE International Conference on Automation Science and Engineering, 2019

SMT Solvers for Flexible Job-Shop Scheduling Problems: A Computational Analysis.
Proceedings of the 15th IEEE International Conference on Automation Science and Engineering, 2019

2018
SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation.
Proceedings of the 14th IEEE International Conference on Automation Science and Engineering, 2018


  Loading...