Mauro Dell'Amico
Orcid: 0000-0002-3283-6131
According to our database1,
Mauro Dell'Amico
authored at least 82 papers
between 1989 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
Lower and upper bounds for scheduling a real-life assembly problem with precedences and resource constraints.
Comput. Oper. Res., 2025
2024
Comput. Oper. Res., March, 2024
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times.
Algorithms, 2024
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones.
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem.
Comput. Oper. Res., August, 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
A Machine Learning Approach to Speed up the Solution of the Distributor's Pallet Loading Problem.
Proceedings of the Numerical Computations: Theory and Algorithms, 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
Int. Trans. Oper. Res., 2022
IEEE Access, 2022
2021
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem.
Optim. Lett., 2021
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
Comput. Oper. Res., 2020
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem.
Ann. Oper. Res., 2020
Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems, 2020
2019
Math. Methods Oper. Res., 2019
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines.
Eur. J. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Discret. Appl. Math., 2019
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
Proceedings of the Machine Learning, Optimization, and Big Data, 2017
2016
Transp. Sci., 2016
A Decision Support System for Highway Construction: The Autostrada Pedemontana Lombarda.
Interfaces, 2016
Comput. Oper. Res., 2016
2015
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
Discret. Appl. Math., 2014
2013
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks.
INFORMS J. Comput., 2013
Discret. Optim., 2013
2012
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.
J. Heuristics, 2012
2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading.
Comput. Oper. Res., 2010
2009
2008
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
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
2005
J. Heuristics, 2005
Eur. J. Oper. Res., 2005
2004
IEEE Trans. Wirel. Commun., 2004
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||C<sub>max</sub> Problem.
J. Heuristics, 2004
2003
Discret. Appl. Math., 2003
2002
A linear time algorithm for scheduling outforests with communication delays on three processors.
J. Algorithms, 2002
Discret. Appl. Math., 2002
Proceedings of the IEEE International Conference on Communications, 2002
2001
Discret. Appl. Math., 2001
2000
J. Comb. Optim., 2000
Discret. Appl. Math., 2000
1999
Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.
J. Heuristics, 1999
1998
Comput. Oper. Res., 1998
Ann. Oper. Res., 1998
1997
1996
Oper. Res. Lett., 1996
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
ACM Trans. Math. Softw., 1995
INFORMS J. Comput., 1995
Discret. Appl. Math., 1995
1993
1989
Networks, 1989