Adriano Masone

Orcid: 0000-0002-8515-736X

According to our database1, Adriano Masone authored at least 14 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
New features for customer classification in the Flying Sidekick Traveling Salesman Problem.
Expert Syst. Appl., 2024

Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting.
Comput. Oper. Res., 2024

2023
A new <i>MILP</i> formulation for the flying sidekick traveling salesman problem.
Networks, October, 2023

The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach.
Eur. J. Oper. Res., June, 2023

Using regression models to understand the impact of route-length variability in practical vehicle routing.
Optim. Lett., 2023

2022
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements.
Networks, 2022

2021
Modeling and Solving the Intersection Inspection Rural Postman Problem.
INFORMS J. Comput., 2021

A MILP Formulation for an Automated Guided Vehicle Scheduling Problem with Battery Constraints.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

Integer Linear Programming for optimizing the position of IEDs in Medium Voltage smart grids.
Proceedings of the IEEE International Instrumentation and Measurement Technology Conference, 2021

2020
Instances for the Intersection Inspection Rural Postman Problem.
Dataset, August, 2020

Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas.
Proceedings of the Machine Learning, Optimization, and Data Science, 2020

2019
The Minimum Routing Cost Tree Problem - State of the art and a core-node based heuristic algorithm.
Soft Comput., 2019

A three-stage p-median based exact method for the optimal diversity management problem.
Networks, 2019


  Loading...