default search action
Andrea Bettinelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c4]Erica Silvestri, Tommaso Volpi
, Andrea Bettinelli, Mattia De Francisci, Judson Jones, Maurizio Corbetta
Image-derived Input Function in brain [18F]FDG PET data: which alternatives to the carotid siphons? EMBC 2022: 243-246
2010 – 2019
- 2019
- [j8]Andrea Bettinelli, Valentina Cacchiani
A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities. Eur. J. Oper. Res. 279(3): 824-839 (2019) - 2017
- [j7]Andrea Bettinelli
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. INFORMS J. Comput. 29(3): 457-473 (2017) - 2016
- [j6]Andrea Stajkic, Melchiorre Danilo Abrignani, Chiara Buratti, Andrea Bettinelli
From a Real Deployment to a Downscaled Testbed: A Methodological Approach. IEEE Internet Things J. 3(5): 647-657 (2016) - 2015
- [j5]Andrea Bettinelli
Community detection with the weighted parsimony criterion. J. Syst. Sci. Complex. 28(3): 517-545 (2015) - [i1]Andrea Bettinelli, Sandro Bosio, Valentina Cacchiani:
Heuristic Solutions to a Mailroom Inserting Machine Planning Problem. CTW 2015: 77-80 - 2014
- [j4]Andrea Bettinelli
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2): 171-197 (2014) - 2013
- [j3]Andrea Bettinelli
The Anonymous Subgraph Problem. Comput. Oper. Res. 40(4): 973-979 (2013) - 2010
- [j2]Andrea Bettinelli
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Ann. Oper. Res. 179(1): 221-241 (2010) - [c3]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows. CTW 2010: 25-28
2000 – 2009
- 2009
- [c2]Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey:
The Anonymous Subgraph Problem. CTW 2009: 269-274 - 2008
- [j1]Andrea Bettinelli
A branch-and-price algorithm for the two-dimensional level strip packing problem. 4OR 6(4): 361-374 (2008) - 2007
- [c1]Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. CTW 2007: 23-27
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-08-05 20:17 CEST 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: