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 graduate courses in mathematical programming. Since 1999 he is with the Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy, where he is an Associate Professor in Operations Research.

Combinatorial and mixed integer optimization problems related to graphs, networks, and infeasible linear systems:
- minimum cycle bases in graphs, optimal routing and flow problems with reload costs, graph problems related to hazardous material transportation,
- network planning (UMTS, WLANs, Mesh), network design under traffic uncertainty, energy-aware (green) network design,
- maximum feasible subsystems of infeasible linear systems, partition into a minimum number of feasible subsystems, sparse approximate solutions.
Exact and approximate algorithms with applications in telecommunications, data mining, energy, health care management, transportation, computational finance and image processing.

Approximate solution of NP-hard optimization problems: inapproximability results and polynomial-time algorithms with performance guarantees.

Design of linear classifiers and of feedforward neural networks. Clustering problems, in particular clustering w.r.t. hyperplanes. Discrete optimization approaches to fitting piecewise linear models to data. Applications also in pattern recognition and image processing.

2011 IBM Faculty Award for the project "Energy-aware optimization of wireline networks"

2005 IBM Faculty Award for the work on the Maximum Feasible Subsystem problem (MaxFS)

Since 2005 on the Steering Committee of the International Symposium on Experimental Algorithms (SEA/WEA).
SEA 2012 website and call for papers, June 7 - 9, 2012, Bordeaux, France.

International Network Optimization Conference (INOC 2011), Hamburg, Germany -- Call for papers, submission deadline February 15, 2011
International Network Optimization Conference (INOC 2009), Pisa, Italy, April 26-29, 2009.
International Network Optimization Conference (INOC 2007), Spa, Belgium, April 22-25, 2007.
14th Annual European Symposium on Algorithms (ESA 2006, Track B), Zuerich, Switzerland, September 11-13, 2006.
4th International Workshop on Efficient and Experimental Algorithms (WEA 2005) Santorini, Greece, May 10-13
3rd International Workshop on Efficient and Experimental Algorithms (WEA 2004), Rio de Janeiro, Brazil, May 25-28
CTW 2004 on Graphs and Combinatorial Optimization Loveno di Menaggio, Italy, May 31-June 2

Since 2007 on the board of the European Network Optimization Group (ENOG), a working group within the Association of European Operational Research Societies (EURO).