default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSabino Francesco Roselli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Sabino Francesco Roselli
, Martin Fabian, Knut Åkesson:
Conflict-free electric vehicle routing problem: an improved compositional algorithm. Discret. Event Dyn. Syst. 34(1): 21-51 (2024)- [c9]Francesco Popolizio, Martina Vinetti, Alvin Combrink, Sabino Francesco Roselli, Maria Pia Fanti, Martin Fabian:
Online Conflict-Free Scheduling of Fleets of Autonomous Mobile Robots. CASE 2024: 3063-3068 - [c8]Sabino Francesco Roselli, Martin Dahl, Mukund Subramaniyan, Ebru Turanoglu Bekar, Anders Skoogh:
Integrating Machine and Quality Data for Predictive Maintenance in Manufacturing System. APMS (5) 2024: 95-107 - 2022
- [j2]Sabino Francesco Roselli, Per-Lage Götvall, Martin Fabian, Knut Åkesson:
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem. IEEE Trans Autom. Sci. Eng. 19(3): 1405-1421 (2022) - [i3]Sabino Francesco Roselli, Per-Lage Götvall, Martin Fabian, Knut Åkesson:
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem. CoRR abs/2203.06977 (2022) - 2021
- [j1]Sabino Francesco Roselli, Fredrik Hagebring, Sarmad Riazi, Martin Fabian, Knut Åkesson:
On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering. IEEE Trans Autom. Sci. Eng. 18(1): 369-381 (2021) - [c7]Sabino Francesco Roselli, Martin Fabian, Knut Åkesson:
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem. CASE 2021: 1364-1369 - [c6]Sabino Francesco Roselli, Martin Fabian, Knut Åkesson:
Solving the Conflict-Free Electric Vehicle Routing Problem Using SMT Solvers. MED 2021: 542-547 - [i2]Sabino Francesco Roselli, Martin Fabian, Knut Åkesson:
Solving the Conflict-Free Electric Vehicle Routing Problem Using SMT Solvers. CoRR abs/2103.08217 (2021) - [i1]Sabino Francesco Roselli, Martin Fabian, Knut Åkesson:
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem. CoRR abs/2106.07387 (2021) - 2020
- [c5]Elinor Jernheden, Carl Lindström, Rickard Persson, Max Wedenmark, Endre Erós, Sabino Francesco Roselli, Knut Åkesson:
Comparison of Exact and Approximate methods for the Vehicle Routing Problem with Time Windows. CASE 2020: 378-383 - [c4]Sabino Francesco Roselli, Kristofer Bengtsson, Knut Åkesson:
Compact Representation of Time-Index Job Shop Problems Using a Bit-Vector Formulation. CASE 2020: 1590-1595
2010 – 2019
- 2019
- [c3]Sabino Francesco Roselli, Kristofer Bengtsson, Knut Åkesson:
SMT Solvers for Flexible Job-Shop Scheduling Problems: A Computational Analysis. CASE 2019: 673-678 - [c2]Sabino Francesco Roselli, Fredrik Hagebring, Sarmad Riazi, Martin Fabian, Knut Åkesson:
On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering. CASE 2019: 1004-1009 - 2018
- [c1]Sabino Francesco Roselli, Kristofer Bengtsson, Knut Åkesson:
SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation. CASE 2018: 547-552
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
