Mauro Dell'Amico

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 Journal on Computing 25(1): 41-55 (2013)

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): 939-942 (2012)

Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori: The Bin Packing Problem with Precedence Constraints. Operations Research 60(6): 1491-1504 (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: 36-39

Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Computers & OR 37(5): 970-980 (2010)

Roberto Baldacci, Mauro Dell'Amico: Heuristic algorithms for the multi-depot ring-star problem. European Journal of Operational Research 203(1): 270-281 (2010)

Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello: Assignment Problems. SIAM 2009, isbn 978-0-89871-663-4, pp. I-XX, 1-382

Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Roberto Montanari: The single-finger keyboard layout problem. Computers & OR 36(11): 3002-3012 (2009)

Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci: Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. INFORMS Journal on Computing 20(3): 333-344 (2008)

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

Roberto Baldacci, Mauro Dell'Amico, J. Salazar González: The Capacitated m-Ring-Star Problem. Operations Research 55(6): 1147-1162 (2007)

Mauro Dell'Amico, Michele Monaci, Corrado Pagani, Daniele Vigo: Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transportation Science 41(4): 516-526 (2007)

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

Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci: Lower bounds and heuristic algorithms for the k. European Journal of Operational Research 171(3): 725-742 (2006)

Mauro Dell'Amico, Giovanni Righini, Matteo Salani: A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection. Transportation Science 40(2): 235-247 (2006)

Mauro Dell'Amico, Silvano Martello: A note on exact algorithms for the identical parallel machine scheduling problem. European Journal of Operational Research 160(2): 576-578 (2005)

Roberto Aringhieri, Mauro Dell'Amico: Comparing Metaheuristic Algorithms for Sonet Network Design Problems. J. Heuristics 11(1): 35-57 (2005)

Mauro Dell'Amico, Manuel Iori, Silvano Martello: Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||C_max Problem. J. Heuristics 10(2): 169-204 (2004)

Mauro Dell'Amico, Francesco Maffioli, Maria Luisa Merani: A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. IEEE Transactions on Wireless Communications 3(4): 1013-1017 (2004)

Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli: The Base-matroid and Inverse Combinatorial Optimization Problems. Discrete Applied Mathematics 128(2-3): 337-353 (2003)

Mauro Dell'Amico, Silvano Martello, Daniele Vigo: A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics 118(1-2): 13-24 (2002)

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

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

Mauro Dell'Amico, Andrea Lodi, Silvano Martello: Efficient algorithms and codes for k-cardinality assignment problems. Discrete Applied Mathematics 110(1): 25-40 (2001)

Mauro Dell'Amico, Paolo Toth: Algorithms and codes for dense assignment problems: the state of the art. Discrete Applied Mathematics 100(1-2): 17-48 (2000)

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

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

Mauro Dell'Amico, Silvano Martello: Reduction of the Three-Partition Problem. J. Comb. Optim. 3(1): 17-30 (1999)

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

Mauro Dell'Amico, Francesco Maffioli, Marco Trubian: New bounds for optimum traffic assignment in satellite communication. Computers & OR 25(9): 729-743 (1998)

Mauro Dell'Amico, Silvano Martello: The k-cardinality Assignment Problem. Discrete Applied Mathematics 76(1-3): 103-121 (1997)

Mauro Dell'Amico, Francesco Maffioli: on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discrete Applied Mathematics 65(1-3): 191-206 (1996)

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

Mauro Dell'Amico, Silvano Martello, Daniele Vigo: Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. Discrete Applied Mathematics 63(1): 25-41 (1995)

Mauro Dell'Amico, Silvano Martello: Optimal Scheduling of Tasks on Identical Parallel Processors. INFORMS Journal on Computing 7(2): 191-200 (1995)

Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth: Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. ACM Trans. Math. Softw. 21(4): 394-409 (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): 410-415 (1995)

Mauro Dell'Amico, Marco Trubian: Applying tabu search to the job-shop scheduling problem. Annals OR 41(3): 231-252 (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): 531-548 (1989)