Mauro Dell'Amico

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 33

Top Topics

Traveling Salesman

Routing Problem

Packing Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. MIC (1) (2024)
Andrea Corsini, Angelo Porrello, Simone Calderara, Mauro Dell'Amico
Self-Labeling the Job Shop Scheduling Problem. CoRR (2024)
Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. Algorithms 17 (1) (2024)
Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini
Parallel drone scheduling vehicle routing problems with collective drones. Comput. Oper. Res. 163 (2024)
Roberto Montemanni, Mauro Dell'Amico
Constraint programming models for the parallel drone scheduling vehicle routing problem. EURO J. Comput. Optim. 11 (2023)
Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
Precedence-Constrained arborescences. Eur. J. Oper. Res. 307 (2) (2023)
Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. Comput. Oper. Res. 156 (2023)
Roberto Montemanni, Mauro Dell'Amico
Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. Algorithms 16 (1) (2023)
Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. FedCSIS (2023)
Andrea Corsini, Simone Calderara, Mauro Dell'Amico
Learning the Quality of Machine Permutations in Job Shop Scheduling. CoRR (2022)
Andrea Corsini, Simone Calderara, Mauro Dell'Amico
Learning the Quality of Machine Permutations in Job Shop Scheduling. IEEE Access 10 (2022)
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
Exact models for the flying sidekick traveling salesman problem. Int. Trans. Oper. Res. 29 (3) (2022)
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. Optim. Lett. 15 (5) (2021)
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone. CoRR (2021)
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
Modeling the flying sidekick traveling salesman problem with multiple drones. Networks 78 (3) (2021)
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. Ann. Oper. Res. 289 (2) (2020)
Arthur Kramer, Mauro Dell'Amico, Dominique Feillet, Manuel Iori
Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. Comput. Oper. Res. 123 (2020)
Mauro Dell'Amico, Natalia Selini Hadjidimitriou, Giulia Renzi
Assessing the Impact of Shared L-Category Electric Vehicles in six European cities. ITSC (2020)
Mauro Dell'Amico, Fabio Furini, Manuel Iori
A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114 (2020)
Natalia Selini Hadjidimitriou, Marco Lippi, Mauro Dell'Amico, Alexander Skiera
Machine Learning for Severity Classification of Accidents Involving Powered Two Wheelers. IEEE Trans. Intell. Transp. Syst. 21 (10) (2020)
Mauro Dell'Amico, José Neto
On total f-domination: Polyhedral and algorithmic results. Discret. Appl. Math. 258 (2019)
Mauro Dell'Amico, José Neto
-domination: polyhedral and algorithmic results. Math. Methods Oper. Res. 90 (1) (2019)
Arthur Kramer, Mauro Dell'Amico, Manuel Iori
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. Eur. J. Oper. Res. 275 (1) (2019)
Mauro Dell'Amico, Maxence Delorme, Manuel Iori, Silvano Martello
Mathematical models and decomposition methods for the multiple knapsack problem. Eur. J. Oper. Res. 274 (3) (2019)
Arthur Kramer, Mauro Dell'Amico, Manuel Iori
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. CoRR (2018)
Selini Natalia Hadjidimitriou, Marco Mamei, Mauro Dell'Amico, Ioannis Kaparias
Classification of Livebus arrivals user behavior. J. Intell. Transp. Syst. 21 (5) (2017)
Mauro Dell'Amico, Natalia Selini Hadjidimitriou, Thorsten Koch, Milena Petkovic
Forecasting Natural Gas Flows in Large Networks. MOD (2017)
Enrico Bartolini, Mauro Dell'Amico, Manuel Iori
Scheduling cleaning activities on trains by minimizing idle times. J. Sched. 20 (5) (2017)
Raphael Kramer, Mauro Dell'Amico, Manuel Iori
A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints. Int. J. Prod. Res. 55 (21) (2017)
Mauro Dell'Amico, Stefano Novellani
A two-echelon facility location problem with stochastic demands for urban construction logistics: An application within the SUCCESS project. SOLI (2017)
Mauro Dell'Amico, Manuel Iori, Stefano Novellani, Thomas Stützle
A destroy and repair algorithm for the Bike sharing Rebalancing Problem. Comput. Oper. Res. 71 (2016)
Mauro Dell'Amico, Guenther Fuellerer, Gerhard Höfinger, Manuel Iori, Stefano Novellani
A Decision Support System for Highway Construction: The Autostrada Pedemontana Lombarda. Interfaces 46 (3) (2016)
Mauro Dell'Amico, José Carlos Díaz Díaz, Geir Hasle, Manuel Iori
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem. Transp. Sci. 50 (4) (2016)
Alberto Caprara, Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Romeo Rizzi
Friendly bin packing instances without Integer Round-up Property. Math. Program. 150 (1) (2015)
Selini Natalia Hadjidimitriou, Mauro Dell'Amico, Guido Cantelmo, Francesco Viti
Assessing the consistency between observed and modelled route choices through GPS data. MT-ITS (2015)
Mauro Dell'Amico, Simone Falavigna, Manuel Iori
Optimization of a Real-World Auto-Carrier Transportation Problem. Transp. Sci. 49 (2) (2015)
Jean-François Côté, Mauro Dell'Amico, Manuel Iori
Combinatorial Benders' Cuts for the Strip Packing Problem. Oper. Res. 62 (3) (2014)
François Clautiaux, Mauro Dell'Amico, Manuel Iori, Ali Khanafer
Lower and upper bounds for the Bin Packing Problem with Fragile Objects. Discret. Appl. Math. 163 (2014)
Manuel A. Alba Martínez, Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS J. Comput. 25 (1) (2013)
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
Exact algorithms for the bin packing problem with fragile objects. Discret. Optim. 10 (3) (2013)
Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori
The Bin Packing Problem with Precedence Constraints. Oper. Res. 60 (6) (2012)
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. J. Heuristics 18 (6) (2012)
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
Models and Algorithms for the Bin Packing Problem with Fragile Objects. CTW (2011)
Roberto Baldacci, Mauro Dell'Amico
Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203 (1) (2010)
Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 37 (5) (2010)
Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Roberto Montanari
The single-finger keyboard layout problem. Comput. Oper. Res. 36 (11) (2009)
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. INFORMS J. Comput. 20 (3) (2008)
Mauro Dell'Amico, Manuel Iori, Daniele Pretolani
Shortest paths in piecewise continuous time-dependent networks. Oper. Res. Lett. 36 (6) (2008)
Mauro Dell'Amico, Stefano Marzani, Luca Minin, Roberto Montanari, Francesco Tesauri, Michele Mariani, Cristina Iani, Fabio Tango
Design of an Adaptive Feedback Based Steering Wheel. HCI (17) (2007)
Mauro Dell'Amico, Michele Monaci, Corrado Pagani, Daniele Vigo
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transp. Sci. 41 (4) (2007)
Roberto Baldacci, Mauro Dell'Amico, J. Salazar González
-Ring-Star Problem. Oper. Res. 55 (6) (2007)
Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci
Lower bounds and heuristic algorithms for the k. Eur. J. Oper. Res. 171 (3) (2006)
Mauro Dell'Amico, Giovanni Righini, Matteo Salani
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection. Transp. Sci. 40 (2) (2006)
Mauro Dell'Amico, Silvano Martello
A note on exact algorithms for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 160 (2) (2005)
Roberto Aringhieri, Mauro Dell'Amico
Comparing Metaheuristic Algorithms for Sonet Network Design Problems. J. Heuristics 11 (1) (2005)
Mauro Dell'Amico, Francesco Maffioli, Maria Luisa Merani
A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. IEEE Trans. Wirel. Commun. 3 (4) (2004)
Mauro Dell'Amico, Manuel Iori, Silvano Martello
Problem. J. Heuristics 10 (2) (2004)
Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli
The Base-matroid and Inverse Combinatorial Optimization Problems. Discret. Appl. Math. 128 (2-3) (2003)
Mauro Dell'Amico, Silvano Martello, Daniele Vigo
A lower bound for the non-oriented two-dimensional bin packing problem. Discret. Appl. Math. 118 (1-2) (2002)
Mauro Dell'Amico, Lucian Finta
A linear time algorithm for scheduling outforests with communication delays on three processors. J. Algorithms 44 (2) (2002)
Mauro Dell'Amico, Maria Luisa Merani, Francesco Maffioli
Efficient algorithms for the assignment of OVSF codes in wideband CDMA. ICC (2002)
Mauro Dell'Amico, Andrea Lodi, Silvano Martello
Efficient algorithms and codes for k-cardinality assignment problems. Discret. Appl. Math. 110 (1) (2001)
Mauro Dell'Amico, Francesco Maffioli
Combining Linear and Non-Linear Objectives in Spanning Tree Problems. J. Comb. Optim. 4 (2) (2000)
Mauro Dell'Amico, Paolo Toth
Algorithms and codes for dense assignment problems: the state of the art. Discret. Appl. Math. 100 (1-2) (2000)
Mauro Dell'Amico, Silvano Martello
Reduction of the Three-Partition Problem. J. Comb. Optim. 3 (1) (1999)
Mauro Dell'Amico, Martine Labbé, Francesco Maffioli
Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25 (3) (1999)
Mauro Dell'Amico, Andrea Lodi, Francesco Maffioli
Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. J. Heuristics 5 (2) (1999)
Mauro Dell'Amico, Marco Trubian
Solution of large weighted equicut problems. Eur. J. Oper. Res. 106 (2-3) (1998)
Mauro Dell'Amico, Francesco Maffioli, Marco Trubian
New bounds for optimum traffic assignment in satellite communication. Comput. Oper. Res. 25 (9) (1998)
Mauro Dell'Amico, Francesco Maffioli, Anna Sciomachen
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. Ann. Oper. Res. 81 (1998)
Mauro Dell'Amico, Silvano Martello
The k-cardinality Assignment Problem. Discret. Appl. Math. 76 (1-3) (1997)
Mauro Dell'Amico, Martine Labbé, Francesco Maffioli
Complexity of spanning tree problems with leaf-dependent objectives. Networks 27 (3) (1996)
Mauro Dell'Amico
Shop Problems With Two Machines and Time Lags. Oper. Res. 44 (5) (1996)
Mauro Dell'Amico, Silvano Martello
Open shop, satellite communication and a theorem by Egerváry (1931). Oper. Res. Lett. 18 (5) (1996)
Mauro Dell'Amico, Francesco Maffioli
on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discret. Appl. Math. 65 (1-3) (1996)
Mauro Dell'Amico, Silvano Martello
Optimal Scheduling of Tasks on Identical Parallel Processors. INFORMS J. Comput. 7 (2) (1995)
Mauro Dell'Amico, Silvano Martello, Daniele Vigo
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. Discret. Appl. Math. 63 (1) (1995)
Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21 (4) (1995)
Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth
Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21 (4) (1995)
Mauro Dell'Amico, Marco Trubian
Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41 (3) (1993)
Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth
A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19 (5) (1989)