Edoardo Amaldi

Dipartimento di Elettronica e Informazione
Politecnico di Milano
Piazza Leonardo da Vinci 32
20133 Milano
Italy

Telephone: + 39 02 2399-3567
Fax: + 39 02 2399-3412
E-mail: amaldi@elet.polimi.it

Biographical sketch

Edoardo Amaldi received the "Diplome" in Mathematical Engineering from the Swiss Federal Institute of Technology at Lausanne (EPFL) in 1988. After one year in the Computational and Neural Systems Program, California Institute of Technology, USA, he came back at EPFL where he earned the "Doctorat ès Sciences" (PhD) in October 1994. He then joined the School of Operations Research and Industrial Engineering, Cornell University, USA, where he did research and taught. Since 1998 he is with the Dipartimento di Elettronica e Informazione (DEI), Politecnico di Milano, Italy, where he is currently an Associate Professor in Operations Research.

Research Interests:

Discrete optimization
Combinatorial optimization problems mainly related to infeasible linear systems, graphs and networks:
- maximum feasible subsystems, partitions into a minimum number of feasible subsystems, sparse approximate solutions;
- minimum (fundamental) cycle bases in graphs;
- network planning (UMTS, Wireless LAN), routing in IP networks, packet scheduling with intelligent antennas.
Exact and approximate algorithms with applications in telecommunications, image/signal processing and computational finance.

Algorithms and computational complexity
Approximate solution of NP-hard optimization problems: inapproximability results and algorithms with performance guarantees

Machine learning
Design of linear classifiers and artificial neural networks, interest for other types of models.

Conferences:

This year on the program committees of
Third International Workshop on Experimental and Efficient Algorithms (WEA'2004), Agra dos Reis, Brazil, May 25-28
CTW 2004 on Graphs and Combinatorial Optimization Loveno di Menaggio, Italy, May 31-June 2

Teaching:

Pointers to the webpages of some recent courses

Selected Publications:

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs, with M. E. Pfetsch and L. E. Trotter Jr., Math. Programming, Ser. A, Vol. 95 (2003) 3, 533-554.
Planning UMTS base station location: optimization models with power control and algorithms, with A. Capone and F. Malucelli, IEEE Transactions on Wireless Communications, Vol. 2, No. 5 (2003) 939-952.
The MIN PFS problem and piecewise linear model estimation, with M. Mattavelli, Discrete Applied Mathematics, Vol. 118 (2002) 115-143.
Feasibility study of a dial-a-ride system for a suburban area of Milan, with A. Colorni and S. Fiorenzo Catalano, Ricerca Operativa, Vol. 30, n. 94-95 (2000) 5-28.
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, with Viggo Kann, Theoretical Computer Science Vol. 209 (1998) 237-260.
Two constructive methods for designing compact feedforward networks of threshold units, with B. Guenin, International Journal on Neural Systems, Vol. 8 (1997) 629-646.
The complexity and approximability of finding maximum feasible subsystems of linear relations, with Viggo Kann, Theoretical Computer Science, Vol. 147 (1995) 181-210.