default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdriano Masone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]Adriano Masone, Mauro Russo, Claudio Sterle:
Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting. Comput. Oper. Res. 167: 106490 (2024)- [j8]Maurizio Boccia
, Andrea Mancuso, Adriano Masone, Teresa Murino, Claudio Sterle:
New features for customer classification in the Flying Sidekick Traveling Salesman Problem. Expert Syst. Appl. 247: 123106 (2024) - 2023
- [j7]Maurizio Boccia, Adriano Masone, Claudio Sterle, Teresa Murino:
The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach. Eur. J. Oper. Res. 307(2): 590-603 (2023) - [j6]Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle:
A new MILP formulation for the flying sidekick traveling salesman problem. Networks 82(3): 254-276 (2023) - [j5]Debdatta Sinha Roy, Bruce L. Golden, Adriano Masone, Edward A. Wasil:
Using regression models to understand the impact of route-length variability in practical vehicle routing. Optim. Lett. 17(1): 163-175 (2023) - 2022
- [j4]Adriano Masone, Stefan Poikonen, Bruce L. Golden:
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements. Networks 80(2): 193-215 (2022) - 2021
- [j3]Debdatta Sinha Roy, Adriano Masone, Bruce L. Golden, Edward A. Wasil:
Modeling and Solving the Intersection Inspection Rural Postman Problem. INFORMS J. Comput. 33(3): 1245-1257 (2021) - 2019
- [j2]Adriano Masone, Claudio Sterle, Igor Vasilyev, Anton V. Ushakov:
A three-stage p-median based exact method for the optimal diversity management problem. Networks 74(2): 174-189 (2019) - [j1]Adriano Masone, Maria Elena Nenni, Antonio Sforza, Claudio Sterle:
The Minimum Routing Cost Tree Problem - State of the art and a core-node based heuristic algorithm. Soft Comput. 23(9): 2947-2957 (2019)
Conference and Workshop Papers
- 2021
- [c4]Claudio Sterle, Vincenzo Caragallo, Annalisa Liccardo, Adriano Masone, Alessandro Fatica, Francesco Bonavolontà:
Integer Linear Programming for optimizing the position of IEDs in Medium Voltage smart grids. I2MTC 2021: 1-5 - [c3]Adriano Masone, Teresa Murino, Claudio Sterle, Monica Strazzullo:
A MILP Formulation for an Automated Guided Vehicle Scheduling Problem with Battery Constraints. APMS (3) 2021: 15-23 - 2020
- [c2]Maurizio Boccia, Antonio Diglio, Adriano Masone, Claudio Sterle:
A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas. LOD (1) 2020: 625-636 - [c1]Maurizio Boccia, Adriano Masone, Antonio Sforza, Claudio Sterle:
Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches. MOTOR 2020: 315-328
Data and Artifacts
- 2020
- [d1]Debdatta Sinha Roy, Adriano Masone, Bruce L. Golden, Edward A. Wasil:
Instances for the Intersection Inspection Rural Postman Problem. Zenodo, 2020
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-10-07 22:24 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:
