Publications

Journals

J.F. Cordeau, M. Dell'Amico and M. Iori (2010).Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, Computers & Operations Research, 37, 970--980.
R. Baldacci, M. Dell'Amico (2010). Heuristic Algorithms for the Multiple-Depot Ring-Star Problem, European Journal of Operational Research,, 203, 270-281.
M. Dell'Amico, J.C. Diaz D\iaz, M. Iori, R. Montanari (2009).The single-finger keyboard layout problem. Computers & Operations Research, 36, 3002-3012
M. Dell'Amico, M. Iori, D. Pretolani (2008).Shortest Paths in Piecewise Continuous Time-Dependent Networks. Operations Research Letters} 36, 688-691.
M. Dell'Amico, M. Iori, M. Monaci, S. Martello (2008). Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
INFORMS J. on Computing, 20, 333-344..
R. Baldacci, M. Dell'Amico, J.J. Salazar, (2007). The Capacitated m-Ring Star Problem, Operations Research, 55, 1147-1162 (Pdf 361K)
M. Dell'Amico, M. Monaci, C. Pagani., D. Vigo (2007). Heuristic approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transportation Sciences, 41, 516-526.
M. Dell'Amico, M. Iori, M. Monaci, S. Martello, S (2006).Lower Bounds and Heuristic Algorithms for the K_i Partitioning Problem.European Journal of Operational Research, 171, 725-742.
M. Dell'Amico, G. Righini, M. Salani, (2006).A branch and price algorithm for the vehicle routing problem with simultaneous pick-up and delivery, Transportation Sciences, 40, 235-247. (Pdf 183K)
R. Aringhieri, M. Dell'Amico, (2005) Comparing Metaheuristic Algorithms for for Sonet Network Design Problems. Journal of Heuristic, 11, 35-57.
M. Dell’Amico, S. Martello (2005).A Note on Exact Algorithms for the Identical Parallel Machine Scheduling Problem.European Journal of Operational Research, 160, 576-578.(Pdf 106K)
M. Dell'Amico, F. Maffioli, M. Merani, (2004). A Tree Partitioning Dynamic Policy for OVSF Codes Assignment in Wideband CDMA, IEEE Transaction on Wireless Communications 3, 1013-1017. (PostScript 391K)
M. Dell'Amico, M. Iori, S. Martello (2004). Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem
Journal of Heuristics, 10, 169-204.
M. Dell'Amico, F. Malucelli, F. Maffioli, (2003).The Base-Matroid and Inverse Combinatorial Optimization. Discrete Applied Mathematics, 128, 337-353.
M. Dell'Amico, L. Finta (2002). A Linear Time Algorithm for Scheduling Outforests with Communication Delays on Three Processors. Journal of Algorithms 44, 287-307. (PostScript 275K)
M. Dell'Amico, S. Martello, D. Vigo (2002). A Lower Bound for the Non-Orineted Two-Dimensionl Bin Packing Problem. Discrete Applied Mathematics118, 13-24.
M. Dell'Amico, S. Martello (2001). Bounds for the Cardinality Constrained P||Cmax Problem. Journal of Scheduling (zipped PostScript file, 105K)
M. Dell'Amico, F. Maffioli, (2000). Combining Linear and Non Linear Objectives in Spanning Tree Problems. Journal of Combinatorial Optimization, 4, 253-269 (zipped PostScript file, 86K)
M. Dell'Amico, A. Lodi, S. Martello (2000). Efficient Algorithms and Codes for K-Cardinality Assignment Problems. Discrete Applied Mathematics 110,25-40 (zipped PostScript file, 100K)
M. Dell'Amico, P. Toth (2000). Algorithms and Codes for Dense Assignment Problems: the State of the Art. Discrete Applied Mathematics 100, 17-48. (zipped PostScript file, 136K)
M. Dell'Amico, S. Martello (1999). Reduction of the Three-Partition Problem. Journal of Combinatorial Optimization 3, 17-30.
M. Dell'Amico, A. Lodi, F. Maffioli, (1999). Solution of the Cumulative Assignment Problem with a Well-Structured Tabu Search Method. Journal of Heuristics 5.2, 123-143.(zipped PostScript file, 106K)
M. Dell'Amico, M. Labbè, F. Maffioli (1999). Exact Solution of the SONET Ring Loading Problem. Operations Research Letters 25, 119-129. (zipped PostScript file, 93K)
M. Dell'Amico, M. Trubian (1998). Solution of Large Weighted Equicut Problems, European Journal of Operations Research 106, 500-521.
M. Dell'Amico, F. Maffioli, A. Sciomachen (1998). A Lagrangean Heuristic for Prize Collecting Travelling Salesman Problem, Annals of Operations Research 81, 289-305.
M. Dell'Amico, F. Maffioli, M. Trubian (1998). New Bounds for Optimum Traffic Assignment in Satellite Communication, Computers & Operations Research 25, 729-743.
M. Dell'Amico, F. Maffioli (1996). On some Multicriteria Arborescence Problems: Complexity and Algorithms. Discrete Applied Mathematics 65, 191-206.
M. Dell'Amico, M. Labbe, F. Maffioli (1996). Complexity of Spanning Tree Problems with Leaf-Dependant Objective Function. Networks 27, 175-181.
M. Dell'Amico, S. Martello (1996). Open Shop, Satellite Communication and a Theorem by Egerväry (1931), Operations Research Letters 18, 207-211.
M. Dell'Amico (1996). Shop Problems with two Machines and Time-Lags. Operations Research 44, 777-787. M. Dell'Amico, S. Martello (1996). The K-Cardinality Assignment Problem. Discrete Applied Mathematics 76, 103-121.
M. Dell'Amico, S. Martello (1995). Optimal Scheduling of Tasks on Identical Parallel Processors. ORSA Journal on Computing 7, 181-200.
M. Dell'Amico, S. Martello, D. Vigo (1995). Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. Discrete Applied Mathematics 63, 25-41.
G. Carpaneto, M. Dell'Amico, P. Toth (1995). Exact Solution of Large-Scale, Asymmetric Traveling Salesman Problems. ACM Transactions on Mathematical Software 21, 394-409.
G. Carpaneto, M. Dell'Amico, P. Toth (1995). Algorithm 750: CDT A Subroutine for the Exact Solution of Large-Scale, Asymmetric Traveling Salesman Problems. ACM Transactions on Mathematical Software 21, 410-415.
M. Dell'Amico, F Maffioli, P. Varbrand (1995). On Prize-Collecting Tours and the Asymmetric Travelling Salesman Problem. International Transactions on Operational Research 2, 297-308.
M. Dell'Amico, M. Trubian (1993). Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research 41, 231-252.
M. Dell'Amico, M. Fischetti, P. Toth (1993). Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem. Management Science 39, 115-125.
M. Dell'Amico (1990). Un algoritmo euristico per la pianificazione delle risorse nei progetti software. Ricerca Operativa 56, 29-47.
G. Carpaneto, M. Dell'Amico, M. Fischetti, P. Toth (1989). A Branch and Bound Algorithm for the Multiple Depot Vehicle Scheduling Problem. Networks 19, 531-548.
M. Fischetti, S. Martello, P. Toth, G. Carpaneto, M. Dell'Amico (1988). Modelli ed Algoritmi per Problemi di Scheduling in Aziende di Trasporto Pubblico. Ricerca Operativa 48, 3-32.
M. Dell'Amico (1989). Una Nuova Procedura di Assegnamento per il Vehicle Scheduling Problem. Ricerca Operativa51, 3-21.
M. Fischetti, S. Martello, P. Toth, G. Carpaneto, M. Dell'Amico (1988). Modelli ed Algoritmi per Problemi di Scheduling in Aziende di Trasporto Pubblico. Ricerca Operativa 48, 3-32.

Books

R. Burkard, M. Dell'Amico, S. Martello (2009).

Assignment Problems,

SIAM

M. Dell'Amico, F. Maffioli, S. Martello (eds.) (1997).

Annotated Bibliographies in Combinatorial Optimization,

Wiley, Chichester.

M. Dell'Amico (2006).120 Esercizi di Ricerca Operativa - seconda edizione. Pitagora Editrice, Bologna.
R. Baldacci, M. Dell'Amico (2002). Fondamenti di Ricerca Operativa. Pitagora Editrice, Bologna.
M.Dell'Amico (1999). Programmazione Matematica: Parte 1, programmazione lineare . Pitagora Editrice, Bologna.
M.Dell'Amico (1996). 120 Esercizi di Ricerca Operativa. Pitagora Editrice, Bologna.
G. Carpaneto, M. Dell'Amico (1988). Nozioni di Informatica ed Applicazioni Matematiche e di Ricerca Operativa. Tecnoprint, Bologna.

Chapters of books

M. Dell'Amico, A. Lodi (2005). On the integration of Tabu Search techniques in Constraint Programming. Metaheuristic Optimization Via Memory and Evolution, C. Rego and B. Alidaee (eds), Kluwer, 357--371.
R. Aringhieri, M. Dell'Amico. A Variable-Neighborhood Variable-Objective Tabu Search Algorithm for the SONET Ring Assignment with Capacity. Metaheuristic Optimization Via Memory and Evolution, C. Rego and B. Alidaee (eds), Kluwer, 93-116 . (PostScript 400K)
M.Dell'Amico, S. Martello (1997). Linear Assignment. In: M. Dell'Amico, F. Maffioli, S. Martello (eds.). Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 355-371.
M. Dell'Amico, S. Martello, D. Vigo (1996). Heuristic Algorithms for Single Processor Scheduling with Earliness and Tardiness Penalties. In: I.H. Osman, J.P. Kelly (eds.). Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Hingham, 167-182.
M. Dell'Amico, F. Maffioli (1996). A New Tabu Search Approach for the 0-1 Equicut Problem. In: I.H. Osman, J.P. Kelly (eds.). Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Hingham, 361-370.

< back >