default search action
Mauro Dell'Amico
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j69]Dario Bezzi
, Andrea Corsini
Lower and upper bounds for scheduling a real-life assembly problem with precedences and resource constraints. Comput. Oper. Res. 173: 106854 (2025) - 2024
- [j68]Mauro Dell'Amico
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. Algorithms 17(1): 12 (2024) - [j67]Roberto Montemanni
Parallel drone scheduling vehicle routing problems with collective drones. Comput. Oper. Res. 163: 106514 (2024) - [c9]Roberto Montemanni
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. MIC (1) 2024: 136-142 - [i4]Andrea Corsini, Angelo Porrello, Simone Calderara, Mauro Dell'Amico:
Self-Labeling the Job Shop Scheduling Problem. CoRR abs/2401.11849 (2024) - 2023
- [j66]Roberto Montemanni
Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. Algorithms 16(1): 40 (2023) - [j65]Mauro Dell'Amico
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. Comput. Oper. Res. 156: 106248 (2023) - [j64]Roberto Montemanni
Constraint programming models for the parallel drone scheduling vehicle routing problem. EURO J. Comput. Optim. 11: 100078 (2023) - [j63]Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
Precedence-Constrained arborescences. Eur. J. Oper. Res. 307(2): 575-589 (2023) - [c8]Mauro Dell'Amico
Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. FedCSIS 2023: 421-430 - 2022
- [j62]Andrea Corsini
Learning the Quality of Machine Permutations in Job Shop Scheduling. IEEE Access 10: 99541-99552 (2022) - [j61]Mauro Dell'Amico
Exact models for the flying sidekick traveling salesman problem. Int. Trans. Oper. Res. 29(3): 1360-1393 (2022) - [i3]Andrea Corsini, Simone Calderara, Mauro Dell'Amico:
Learning the Quality of Machine Permutations in Job Shop Scheduling. CoRR abs/2207.03244 (2022) - 2021
- [j60]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
Modeling the flying sidekick traveling salesman problem with multiple drones. Networks 78(3): 303-327 (2021) - [j59]Mauro Dell'Amico, Roberto Montemanni
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. Optim. Lett. 15(5): 1617-1648 (2021) - [i2]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani:
Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone. CoRR abs/2107.13275 (2021) - 2020
- [j58]Mauro Dell'Amico, Roberto Montemanni
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. Ann. Oper. Res. 289(2): 211-226 (2020) - [j57]Mauro Dell'Amico, Fabio Furini
A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114 (2020) - [j56]Arthur Kramer
Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. Comput. Oper. Res. 123: 105018 (2020) - [j55]Natalia Selini Hadjidimitriou
Machine Learning for Severity Classification of Accidents Involving Powered Two Wheelers. IEEE Trans. Intell. Transp. Syst. 21(10): 4308-4317 (2020) - [c7]Mauro Dell'Amico, Natalia Selini Hadjidimitriou, Giulia Renzi:
Assessing the Impact of Shared L-Category Electric Vehicles in six European cities. ITSC 2020: 1-5
2010 – 2019
- 2019
- [j54]Mauro Dell'Amico, José Neto:
On total f-domination: Polyhedral and algorithmic results. Discret. Appl. Math. 258: 97-104 (2019) - [j53]Mauro Dell'Amico, Maxence Delorme
Mathematical models and decomposition methods for the multiple knapsack problem. Eur. J. Oper. Res. 274(3): 886-899 (2019) - [j52]Arthur Kramer
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. Eur. J. Oper. Res. 275(1): 67-79 (2019) - [j51]Mauro Dell'Amico, José Neto:
On f-domination: polyhedral and algorithmic results. Math. Methods Oper. Res. 90(1): 1-22 (2019) - 2018
- [i1]Arthur Kramer, Mauro Dell'Amico, Manuel Iori:
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. CoRR abs/1808.10661 (2018) - 2017
- [j50]Raphael Kramer
A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints. Int. J. Prod. Res. 55(21): 6288-6304 (2017) - [j49]Selini Natalia Hadjidimitriou
Classification of Livebus arrivals user behavior. J. Intell. Transp. Syst. 21(5): 375-389 (2017) - [j48]Enrico Bartolini, Mauro Dell'Amico
Scheduling cleaning activities on trains by minimizing idle times. J. Sched. 20(5): 493-506 (2017) - [c6]Mauro Dell'Amico, Natalia Selini Hadjidimitriou
Forecasting Natural Gas Flows in Large Networks. MOD 2017: 158-171 - [c5]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: 90-95 - 2016
- [j47]Mauro Dell'Amico, Manuel Iori
A destroy and repair algorithm for the Bike sharing Rebalancing Problem. Comput. Oper. Res. 71: 149-162 (2016) - [j46]Mauro Dell'Amico, Guenther Fuellerer, Gerhard Höfinger, Manuel Iori
A Decision Support System for Highway Construction: The Autostrada Pedemontana Lombarda. Interfaces 46(3): 245-263 (2016) - [j45]Mauro Dell'Amico, José Carlos Díaz Díaz, Geir Hasle
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem. Transp. Sci. 50(4): 1223-1238 (2016) - 2015
- [j44]Alberto Caprara, Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori
Friendly bin packing instances without Integer Round-up Property. Math. Program. 150(1): 5-17 (2015) - [j43]Mauro Dell'Amico
Optimization of a Real-World Auto-Carrier Transportation Problem. Transp. Sci. 49(2): 402-419 (2015) - [c4]Selini Natalia Hadjidimitriou
Assessing the consistency between observed and modelled route choices through GPS data. MT-ITS 2015: 216-222 - 2014
- [j42]François Clautiaux, Mauro Dell'Amico
Lower and upper bounds for the Bin Packing Problem with Fragile Objects. Discret. Appl. Math. 163: 73-86 (2014) - [j41]Jean-François Côté
Combinatorial Benders' Cuts for the Strip Packing Problem. Oper. Res. 62(3): 643-661 (2014) - 2013
- [j40]Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico
Exact algorithms for the bin packing problem with fragile objects. Discret. Optim. 10(3): 210-223 (2013) - [j39]Manuel A. Alba Martínez, Jean-François Cordeau, Mauro Dell'Amico
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS J. Comput. 25(1): 41-55 (2013) - 2012
- [j38]Mauro Dell'Amico
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. J. Heuristics 18(6): 939-942 (2012) - [j37]Mauro Dell'Amico
The Bin Packing Problem with Precedence Constraints. Oper. Res. 60(6): 1491-1504 (2012) - 2011
- [c3]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: 36-39 - 2010
- [j36]Jean-François Cordeau, Mauro Dell'Amico
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 37(5): 970-980 (2010) - [j35]Roberto Baldacci
Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203(1): 270-281 (2010)
2000 – 2009
- 2009
- [b1]Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello:
Assignment Problems. SIAM 2009, ISBN 978-0-89871-663-4, pp. I-XX, 1-382 - [j34]Mauro Dell'Amico
The single-finger keyboard layout problem. Comput. Oper. Res. 36(11): 3002-3012 (2009) - 2008
- [j33]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): 333-344 (2008) - [j32]Mauro Dell'Amico
Shortest paths in piecewise continuous time-dependent networks. Oper. Res. Lett. 36(6): 688-691 (2008) - 2007
- [j31]Roberto Baldacci
The Capacitated m-Ring-Star Problem. Oper. Res. 55(6): 1147-1162 (2007) - [j30]Mauro Dell'Amico
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transp. Sci. 41(4): 516-526 (2007) - [c2]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: 180-188 - 2006
- [j29]Mauro Dell'Amico
Lower bounds and heuristic algorithms for the k. Eur. J. Oper. Res. 171(3): 725-742 (2006) - [j28]Mauro Dell'Amico
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection. Transp. Sci. 40(2): 235-247 (2006) - 2005
- [j27]Mauro Dell'Amico
A note on exact algorithms for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 160(2): 576-578 (2005) - [j26]Roberto Aringhieri
Comparing Metaheuristic Algorithms for Sonet Network Design Problems. J. Heuristics 11(1): 35-57 (2005) - 2004
- [j25]Mauro Dell'Amico
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem. J. Heuristics 10(2): 169-204 (2004) - [j24]Mauro Dell'Amico
A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. IEEE Trans. Wirel. Commun. 3(4): 1013-1017 (2004) - 2003
- [j23]Mauro Dell'Amico
The Base-matroid and Inverse Combinatorial Optimization Problems. Discret. Appl. Math. 128(2-3): 337-353 (2003) - 2002
- [j22]Mauro Dell'Amico
A lower bound for the non-oriented two-dimensional bin packing problem. Discret. Appl. Math. 118(1-2): 13-24 (2002) - [j21]Mauro Dell'Amico
A linear time algorithm for scheduling outforests with communication delays on three processors. J. Algorithms 44(2): 287-307 (2002) - [c1]Mauro Dell'Amico, Maria Luisa Merani, Francesco Maffioli:
Efficient algorithms for the assignment of OVSF codes in wideband CDMA. ICC 2002: 3055-3060 - 2001
- [j20]Mauro Dell'Amico
Efficient algorithms and codes for k-cardinality assignment problems. Discret. Appl. Math. 110(1): 25-40 (2001) - 2000
- [j19]Mauro Dell'Amico, Paolo Toth:
Algorithms and codes for dense assignment problems: the state of the art. Discret. Appl. Math. 100(1-2): 17-48 (2000) - [j18]Mauro Dell'Amico, Francesco Maffioli:
Combining Linear and Non-Linear Objectives in Spanning Tree Problems. J. Comb. Optim. 4(2): 253-269 (2000)
1990 – 1999
- 1999
- [j17]Mauro Dell'Amico
Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. J. Heuristics 5(2): 123-143 (1999) - [j16]Mauro Dell'Amico, Silvano Martello:
Reduction of the Three-Partition Problem. J. Comb. Optim. 3(1): 17-30 (1999) - [j15]Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999) - 1998
- [j14]Mauro Dell'Amico, Francesco Maffioli, Anna Sciomachen:
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. Ann. Oper. Res. 81: 289-306 (1998) - [j13]Mauro Dell'Amico, Francesco Maffioli, Marco Trubian:
New bounds for optimum traffic assignment in satellite communication. Comput. Oper. Res. 25(9): 729-743 (1998) - [j12]Mauro Dell'Amico, Marco Trubian:
Solution of large weighted equicut problems. Eur. J. Oper. Res. 106(2-3): 500-521 (1998) - 1997
- [j11]Mauro Dell'Amico, Silvano Martello:
The k-cardinality Assignment Problem. Discret. Appl. Math. 76(1-3): 103-121 (1997) - 1996
- [j10]Mauro Dell'Amico, Francesco Maffioli:
on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discret. Appl. Math. 65(1-3): 191-206 (1996) - [j9]Mauro Dell'Amico:
Shop Problems With Two Machines and Time Lags. Oper. Res. 44(5): 777-787 (1996) - [j8]Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Complexity of spanning tree problems with leaf-dependent objectives. Networks 27(3): 175-181 (1996) - [j7]Mauro Dell'Amico
Open shop, satellite communication and a theorem by Egerváry (1931). Oper. Res. Lett. 18(5): 207-211 (1996) - 1995
- [j6]Mauro Dell'Amico
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. Discret. Appl. Math. 63(1): 25-41 (1995) - [j5]Mauro Dell'Amico, Silvano Martello:
Optimal Scheduling of Tasks on Identical Parallel Processors. INFORMS J. Comput. 7(2): 191-200 (1995) - [j4]Giorgio Carpaneto, Mauro Dell'Amico
Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21(4): 394-409 (1995) - [j3]Giorgio Carpaneto, Mauro Dell'Amico
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21(4): 410-415 (1995) - 1993
- [j2]Mauro Dell'Amico
Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41(3): 231-252 (1993)
1980 – 1989
- 1989
- [j1]Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth:
A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5): 531-548 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: