2008 |
24 | EE | 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) |
23 | EE | Mauro Dell'Amico,
Manuel Iori,
D. Pretolani:
Shortest paths in piecewise continuous time-dependent networks.
Oper. Res. Lett. 36(6): 688-691 (2008) |
2007 |
22 | EE | 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 |
21 | EE | 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) |
2005 |
20 | EE | 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) |
19 | EE | Roberto Aringhieri,
Mauro Dell'Amico:
Comparing Metaheuristic Algorithms for Sonet Network Design Problems.
J. Heuristics 11(1): 35-57 (2005) |
2004 |
18 | EE | 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) |
17 | EE | Mauro Dell'Amico,
Manuel Iori,
Silvano Martello:
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem.
J. Heuristics 10(2): 169-204 (2004) |
2003 |
16 | EE | Mauro Dell'Amico,
Francesco Maffioli,
Federico Malucelli:
The Base-matroid and Inverse Combinatorial Optimization Problems.
Discrete Applied Mathematics 128(2-3): 337-353 (2003) |
2002 |
15 | | 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) |
14 | EE | 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) |
2001 |
13 | | Mauro Dell'Amico,
Andrea Lodi,
Silvano Martello:
Efficient algorithms and codes for k-cardinality assignment problems.
Discrete Applied Mathematics 110(1): 25-40 (2001) |
2000 |
12 | | 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) |
11 | | Mauro Dell'Amico,
Francesco Maffioli:
Combining Linear and Non-Linear Objectives in Spanning Tree Problems.
J. Comb. Optim. 4(2): 253-269 (2000) |
1999 |
10 | | Mauro Dell'Amico,
Silvano Martello:
Reduction of the Three-Partition Problem.
J. Comb. Optim. 3(1): 17-30 (1999) |
9 | | 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) |
8 | EE | Mauro Dell'Amico,
Martine Labbé,
Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem.
Oper. Res. Lett. 25(3): 119-129 (1999) |
1998 |
7 | EE | Mauro Dell'Amico,
Francesco Maffioli,
Marco Trubian:
New bounds for optimum traffic assignment in satellite communication.
Computers & OR 25(9): 729-743 (1998) |
1997 |
6 | EE | Mauro Dell'Amico,
Silvano Martello:
The k-cardinality Assignment Problem.
Discrete Applied Mathematics 76(1-3): 103-121 (1997) |
1996 |
5 | EE | Mauro Dell'Amico,
Francesco Maffioli:
on Some Multicriteria Arborescence Problems: Complexity and Algorithms.
Discrete Applied Mathematics 65(1-3): 191-206 (1996) |
4 | EE | Mauro Dell'Amico,
Martine Labbé,
Francesco Maffioli:
Complexity of spanning tree problems with leaf-dependent objectives.
Networks 27(3): 175-181 (1996) |
1995 |
3 | EE | 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) |
2 | EE | 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) |
1 | EE | 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) |