Mauro Dell'Amico

Orcid: 0000-0002-3283-6131

According to our database1, Mauro Dell'Amico authored at least 79 papers between 1989 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parallel drone scheduling vehicle routing problems with collective drones.
Comput. Oper. Res., March, 2024

Self-Labeling the Job Shop Scheduling Problem.
CoRR, 2024

Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times.
Algorithms, 2024

2023
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem.
Comput. Oper. Res., August, 2023

Precedence-Constrained arborescences.
Eur. J. Oper. Res., June, 2023

Constraint programming models for the parallel drone scheduling vehicle routing problem.
EURO J. Comput. Optim., January, 2023

Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming.
Algorithms, January, 2023

Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022
Exact models for the flying sidekick traveling salesman problem.
Int. Trans. Oper. Res., 2022

Learning the Quality of Machine Permutations in Job Shop Scheduling.
IEEE Access, 2022

2021
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem.
Optim. Lett., 2021

Modeling the flying sidekick traveling salesman problem with multiple drones.
Networks, 2021

Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone.
CoRR, 2021

2020
Machine Learning for Severity Classification of Accidents Involving Powered Two Wheelers.
IEEE Trans. Intell. Transp. Syst., 2020

Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time.
Comput. Oper. Res., 2020

A branch-and-price algorithm for the temporal bin packing problem.
Comput. Oper. Res., 2020

Matheuristic algorithms for the parallel drone scheduling traveling salesman problem.
Ann. Oper. Res., 2020

Assessing the Impact of Shared L-Category Electric Vehicles in six European cities.
Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems, 2020

2019
On <i>f</i>-domination: polyhedral and algorithmic results.
Math. Methods Oper. Res., 2019

Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines.
Eur. J. Oper. Res., 2019

Mathematical models and decomposition methods for the multiple knapsack problem.
Eur. J. Oper. Res., 2019

On total f-domination: Polyhedral and algorithmic results.
Discret. Appl. Math., 2019

2017
Scheduling cleaning activities on trains by minimizing idle times.
J. Sched., 2017

Classification of Livebus arrivals user behavior.
J. Intell. Transp. Syst., 2017

A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints.
Int. J. Prod. Res., 2017

A two-echelon facility location problem with stochastic demands for urban construction logistics: An application within the SUCCESS project.
Proceedings of the 2017 IEEE International Conference on Service Operations and Logistics, 2017

Forecasting Natural Gas Flows in Large Networks.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

2016
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem.
Transp. Sci., 2016

A Decision Support System for Highway Construction: The Autostrada Pedemontana Lombarda.
Interfaces, 2016

A destroy and repair algorithm for the Bike sharing Rebalancing Problem.
Comput. Oper. Res., 2016

2015
Optimization of a Real-World Auto-Carrier Transportation Problem.
Transp. Sci., 2015

Friendly bin packing instances without Integer Round-up Property.
Math. Program., 2015

Assessing the consistency between observed and modelled route choices through GPS data.
Proceedings of the 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS), 2015

2014
Combinatorial Benders' Cuts for the Strip Packing Problem.
Oper. Res., 2014

Lower and upper bounds for the Bin Packing Problem with Fragile Objects.
Discret. Appl. Math., 2014

2013
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks.
INFORMS J. Comput., 2013

Exact algorithms for the bin packing problem with fragile objects.
Discret. Optim., 2013

2012
The Bin Packing Problem with Precedence Constraints.
Oper. Res., 2012

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.
J. Heuristics, 2012

2011
Models and Algorithms for the Bin Packing Problem with Fragile Objects.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Heuristic algorithms for the multi-depot ring-star problem.
Eur. J. Oper. Res., 2010

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading.
Comput. Oper. Res., 2010

2009
The single-finger keyboard layout problem.
Comput. Oper. Res., 2009

Assignment Problems.
SIAM, ISBN: 978-0-89871-663-4, 2009

2008
Shortest paths in piecewise continuous time-dependent networks.
Oper. Res. Lett., 2008

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
INFORMS J. Comput., 2008

2007
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows.
Transp. Sci., 2007

The Capacitated <i>m</i>-Ring-Star Problem.
Oper. Res., 2007

Design of an Adaptive Feedback Based Steering Wheel.
Proceedings of the Ergonomics and Health Aspects of Work with Computers, 2007

2006
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection.
Transp. Sci., 2006

Lower bounds and heuristic algorithms for the k.
Eur. J. Oper. Res., 2006

2005
Comparing Metaheuristic Algorithms for Sonet Network Design Problems.
J. Heuristics, 2005

A note on exact algorithms for the identical parallel machine scheduling problem.
Eur. J. Oper. Res., 2005

2004
A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA.
IEEE Trans. Wirel. Commun., 2004

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||C<sub>max</sub> Problem.
J. Heuristics, 2004

2003
The Base-matroid and Inverse Combinatorial Optimization Problems.
Discret. Appl. Math., 2003

2002
A linear time algorithm for scheduling outforests with communication delays on three processors.
J. Algorithms, 2002

A lower bound for the non-oriented two-dimensional bin packing problem.
Discret. Appl. Math., 2002

Efficient algorithms for the assignment of OVSF codes in wideband CDMA.
Proceedings of the IEEE International Conference on Communications, 2002

2001
Efficient algorithms and codes for k-cardinality assignment problems.
Discret. Appl. Math., 2001

2000
Combining Linear and Non-Linear Objectives in Spanning Tree Problems.
J. Comb. Optim., 2000

Algorithms and codes for dense assignment problems: the state of the art.
Discret. Appl. Math., 2000

1999
Exact solution of the SONET Ring Loading Problem.
Oper. Res. Lett., 1999

Reduction of the Three-Partition Problem.
J. Comb. Optim., 1999

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.
J. Heuristics, 1999

1998
Solution of large weighted equicut problems.
Eur. J. Oper. Res., 1998

New bounds for optimum traffic assignment in satellite communication.
Comput. Oper. Res., 1998

A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem.
Ann. Oper. Res., 1998

1997
The k-cardinality Assignment Problem.
Discret. Appl. Math., 1997

1996
Open shop, satellite communication and a theorem by Egerváry (1931).
Oper. Res. Lett., 1996

Complexity of spanning tree problems with leaf-dependent objectives.
Networks, 1996

Shop Problems With Two Machines and Time Lags.
Oper. Res., 1996

on Some Multicriteria Arborescence Problems: Complexity and Algorithms.
Discret. Appl. Math., 1996

1995
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw., 1995

Exact Solution of Large Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw., 1995

Optimal Scheduling of Tasks on Identical Parallel Processors.
INFORMS J. Comput., 1995

Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.
Discret. Appl. Math., 1995

1993
Applying tabu search to the job-shop scheduling problem.
Ann. Oper. Res., 1993

1989
A branch and bound algorithm for the multiple depot vehicle scheduling problem.
Networks, 1989


  Loading...