A branch and bound algorithm for the multiple depot vehicle scheduling problem. - Giorgio Carpaneto; Mauro Dell'Amico; Matteo Fischetti; Paolo Toth (Networks, 1989)

Applying tabu search to the job-shop scheduling problem. - Mauro Dell'Amico; Marco Trubian (Ann. Oper. Res., 1993)

Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. - Mauro Dell'Amico; Silvano Martello; Daniele Vigo (Discret. Appl. Math., 1995)

Optimal Scheduling of Tasks on Identical Parallel Processors. - Mauro Dell'Amico; Silvano Martello (INFORMS J. Comput., 1995)

Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. - Giorgio Carpaneto; Mauro Dell'Amico; Paolo Toth (ACM Trans. Math. Softw., 1995)

Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems. - Giorgio Carpaneto; Mauro Dell'Amico; Paolo Toth (ACM Trans. Math. Softw., 1995)

on Some Multicriteria Arborescence Problems: Complexity and Algorithms. - Mauro Dell'Amico; Francesco Maffioli (Discret. Appl. Math., 1996)

Shop Problems With Two Machines and Time Lags. - Mauro Dell'Amico (Oper. Res., 1996)

Complexity of spanning tree problems with leaf-dependent objectives. - Mauro Dell'Amico; Martine Labbé; Francesco Maffioli (Networks, 1996)

Open shop, satellite communication and a theorem by Egerváry (1931). - Mauro Dell'Amico; Silvano Martello (Oper. Res. Lett., 1996)

The k-cardinality Assignment Problem. - Mauro Dell'Amico; Silvano Martello (Discret. Appl. Math., 1997)

A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. - Mauro Dell'Amico; Francesco Maffioli; Anna Sciomachen (Ann. Oper. Res., 1998)

New bounds for optimum traffic assignment in satellite communication. - Mauro Dell'Amico; Francesco Maffioli; Marco Trubian (Comput. Oper. Res., 1998)

Solution of large weighted equicut problems. - Mauro Dell'Amico; Marco Trubian (Eur. J. Oper. Res., 1998)

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. - Mauro Dell'Amico; Andrea Lodi 001; Francesco Maffioli (J. Heuristics, 1999)

Reduction of the Three-Partition Problem. - Mauro Dell'Amico; Silvano Martello (J. Comb. Optim., 1999)

Exact solution of the SONET Ring Loading Problem. - Mauro Dell'Amico; Martine Labbé; Francesco Maffioli (Oper. Res. Lett., 1999)

Algorithms and codes for dense assignment problems: the state of the art. - Mauro Dell'Amico; Paolo Toth (Discret. Appl. Math., 2000)

Combining Linear and Non-Linear Objectives in Spanning Tree Problems. - Mauro Dell'Amico; Francesco Maffioli (J. Comb. Optim., 2000)

Efficient algorithms and codes for k-cardinality assignment problems. - Mauro Dell'Amico; Andrea Lodi 001; Silvano Martello (Discret. Appl. Math., 2001)

Efficient algorithms for the assignment of OVSF codes in wideband CDMA. - Mauro Dell'Amico; Maria Luisa Merani; Francesco Maffioli (ICC, 2002)

A lower bound for the non-oriented two-dimensional bin packing problem. - Mauro Dell'Amico; Silvano Martello; Daniele Vigo (Discret. Appl. Math., 2002)

A linear time algorithm for scheduling outforests with communication delays on three processors. - Mauro Dell'Amico; Lucian Finta (J. Algorithms, 2002)

The Base-matroid and Inverse Combinatorial Optimization Problems. - Mauro Dell'Amico; Francesco Maffioli; Federico Malucelli (Discret. Appl. Math., 2003)

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello (J. Heuristics, 2004)

A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. - Mauro Dell'Amico; Francesco Maffioli; Maria Luisa Merani (IEEE Trans. Wirel. Commun., 2004)

A note on exact algorithms for the identical parallel machine scheduling problem. - Mauro Dell'Amico; Silvano Martello (Eur. J. Oper. Res., 2005)

Comparing Metaheuristic Algorithms for Sonet Network Design Problems. - Roberto Aringhieri; Mauro Dell'Amico (J. Heuristics, 2005)

Lower bounds and heuristic algorithms for the k. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (Eur. J. Oper. Res., 2006)

A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection. - Mauro Dell'Amico; Giovanni Righini; Matteo Salani (Transp. Sci., 2006)

Design of an Adaptive Feedback Based Steering Wheel. - Mauro Dell'Amico; Stefano Marzani; Luca Minin; Roberto Montanari 003; Francesco Tesauri; Michele Mariani; Cristina Iani; Fabio Tango (HCI (17), 2007)

The Capacitated m-Ring-Star Problem. - Roberto Baldacci; Mauro Dell'Amico; J. Salazar González (Oper. Res., 2007)

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. - Mauro Dell'Amico; Michele Monaci; Corrado Pagani; Daniele Vigo (Transp. Sci., 2007)

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (INFORMS J. Comput., 2008)

Shortest paths in piecewise continuous time-dependent networks. - Mauro Dell'Amico; Manuel Iori; Daniele Pretolani (Oper. Res. Lett., 2008)

Assignment Problems. - Rainer E. Burkard; Mauro Dell'Amico; Silvano Martello (SIAM, 2009)

The single-finger keyboard layout problem. - Mauro Dell'Amico; José Carlos Díaz Díaz; Manuel Iori; Roberto Montanari 003 (Comput. Oper. Res., 2009)

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. - Jean-François Cordeau; Mauro Dell'Amico; Manuel Iori (Comput. Oper. Res., 2010)

Heuristic algorithms for the multi-depot ring-star problem. - Roberto Baldacci; Mauro Dell'Amico (Eur. J. Oper. Res., 2010)

Models and Algorithms for the Bin Packing Problem with Fragile Objects. - Manuel A. Alba Martínez; François Clautiaux; Mauro Dell'Amico; Manuel Iori (CTW, 2011)

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. - Mauro Dell'Amico; Manuel Iori; Silvano Martello; Michele Monaci (J. Heuristics, 2012)

The Bin Packing Problem with Precedence Constraints. - Mauro Dell'Amico; José Carlos Díaz Díaz; Manuel Iori (Oper. Res., 2012)

Exact algorithms for the bin packing problem with fragile objects. - Manuel A. Alba Martínez; François Clautiaux; Mauro Dell'Amico; Manuel Iori (Discret. Optim., 2013)

A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. - Manuel A. Alba Martínez; Jean-François Cordeau; Mauro Dell'Amico; Manuel Iori (INFORMS J. Comput., 2013)

Lower and upper bounds for the Bin Packing Problem with Fragile Objects. - François Clautiaux; Mauro Dell'Amico; Manuel Iori; Ali Khanafer 001 (Discret. Appl. Math., 2014)

Combinatorial Benders' Cuts for the Strip Packing Problem. - Jean-François Côté; Mauro Dell'Amico; Manuel Iori (Oper. Res., 2014)

Assessing the consistency between observed and modelled route choices through GPS data. - Selini Natalia Hadjidimitriou; Mauro Dell'Amico; Guido Cantelmo; Francesco Viti (MT-ITS, 2015)

Friendly bin packing instances without Integer Round-up Property. - Alberto Caprara; Mauro Dell'Amico; José Carlos Díaz Díaz; Manuel Iori; Romeo Rizzi (Math. Program., 2015)

Optimization of a Real-World Auto-Carrier Transportation Problem. - Mauro Dell'Amico; Simone Falavigna; Manuel Iori (Transp. Sci., 2015)

A destroy and repair algorithm for the Bike sharing Rebalancing Problem. - Mauro Dell'Amico; Manuel Iori; Stefano Novellani; Thomas Stützle (Comput. Oper. Res., 2016)

A Decision Support System for Highway Construction: The Autostrada Pedemontana Lombarda. - Mauro Dell'Amico; Guenther Fuellerer; Gerhard Höfinger; Manuel Iori; Stefano Novellani (Interfaces, 2016)

An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem. - Mauro Dell'Amico; José Carlos Díaz Díaz; Geir Hasle; Manuel Iori (Transp. Sci., 2016)

Forecasting Natural Gas Flows in Large Networks. - Mauro Dell'Amico; Natalia Selini Hadjidimitriou; Thorsten Koch; Milena Petkovic 002 (MOD, 2017)

A two-echelon facility location problem with stochastic demands for urban construction logistics: An application within the SUCCESS project. - Mauro Dell'Amico; Stefano Novellani (SOLI, 2017)

A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints. - Raphael Kramer; Mauro Dell'Amico; Manuel Iori (Int. J. Prod. Res., 2017)

Classification of Livebus arrivals user behavior. - Selini Natalia Hadjidimitriou; Marco Mamei; Mauro Dell'Amico; Ioannis Kaparias (J. Intell. Transp. Syst., 2017)

Scheduling cleaning activities on trains by minimizing idle times. - Enrico Bartolini; Mauro Dell'Amico; Manuel Iori (J. Sched., 2017)

On total f-domination: Polyhedral and algorithmic results. - Mauro Dell'Amico; José Neto 001 (Discret. Appl. Math., 2019)

Mathematical models and decomposition methods for the multiple knapsack problem. - Mauro Dell'Amico; Maxence Delorme; Manuel Iori; Silvano Martello (Eur. J. Oper. Res., 2019)

Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. - Arthur Kramer; Mauro Dell'Amico; Manuel Iori (Eur. J. Oper. Res., 2019)

On f-domination: polyhedral and algorithmic results. - Mauro Dell'Amico; José Neto 001 (Math. Methods Oper. Res., 2019)

Assessing the Impact of Shared L-Category Electric Vehicles in six European cities. - Mauro Dell'Amico; Natalia Selini Hadjidimitriou; Giulia Renzi (ITSC, 2020)

Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Ann. Oper. Res., 2020)

A branch-and-price algorithm for the temporal bin packing problem. - Mauro Dell'Amico; Fabio Furini; Manuel Iori (Comput. Oper. Res., 2020)

Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. - Arthur Kramer; Mauro Dell'Amico; Dominique Feillet; Manuel Iori (Comput. Oper. Res., 2020)

Machine Learning for Severity Classification of Accidents Involving Powered Two Wheelers. - Natalia Selini Hadjidimitriou; Marco Lippi 001; Mauro Dell'Amico; Alexander Skiera (IEEE Trans. Intell. Transp. Syst., 2020)

Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (CoRR, 2021)

Modeling the flying sidekick traveling salesman problem with multiple drones. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Networks, 2021)

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Optim. Lett., 2021)

Learning the Quality of Machine Permutations in Job Shop Scheduling. - Andrea Corsini; Simone Calderara; Mauro Dell'Amico (IEEE Access, 2022)

Exact models for the flying sidekick traveling salesman problem. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Int. Trans. Oper. Res., 2022)

Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. - Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (FedCSIS, 2023)

A Machine Learning Approach to Speed up the Solution of the Distributor's Pallet Loading Problem. - Matteo Magnani; Giorgia Franchini; Mauro Dell'Amico; Luca Zanni (NUMTA (1), 2023)

Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. - Roberto Montemanni; Mauro Dell'Amico (Algorithms, 2023)

Constraint programming models for the parallel drone scheduling vehicle routing problem. - Roberto Montemanni; Mauro Dell'Amico (EURO J. Comput. Optim., 2023)

Precedence-Constrained arborescences. - Xiaochen Chou; Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Eur. J. Oper. Res., 2023)

A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. - Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Comput. Oper. Res., 2023)

Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. - Roberto Montemanni; Mauro Dell'Amico; Andrea Corsini (MIC (1), 2024)

Self-Labeling the Job Shop Scheduling Problem. - Andrea Corsini; Angelo Porrello; Simone Calderara; Mauro Dell'Amico (NeurIPS, 2024)

Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. - Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Algorithms, 2024)

Parallel drone scheduling vehicle routing problems with collective drones. - Roberto Montemanni; Mauro Dell'Amico; Andrea Corsini (Comput. Oper. Res., 2024)

Lower and upper bounds for scheduling a real-life assembly problem with precedences and resource constraints. - Dario Bezzi; Andrea Corsini; Mauro Dell'Amico (Comput. Oper. Res., 2025)