|
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 at elet.polimi.it
Home page
Short Bio
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 and mixed integer optimization problems 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 LANs, Mesh networks), network design under traffic uncertainty (VPNs).
Exact and approximate algorithms with applications in telecommunications,
transportation, data mining, health care management and image processing.
Algorithm design and computational complexity
Approximate solution of NP-hard optimization problems: inapproximability results and polynomial-time algorithms with performance guarantees.
Machine learning and data mining
Design of linear classifiers and of feedforward neural networks. Discrete optimization approaches to fitting piecewise linear models to data (clustering w.r.t. hyperplanes). Application areas also include pattern recognition and image processing.
Awards
2005 IBM Faculty Award for work on the Maximum Feasible Subsystem problem (MaxFS)
Conferences:
Recently on the program committees of
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
and since 2005 on the Steering Committee of the International Symposium on Experimental Algorithms (SEA/WEA).
SEA 2010 website and call for papers
Teaching:
Pointers to the webpages of some recent courses
Selected Publications:
-
Hyperbolic set covering problems with competing ground-set elements,
with S. Bosio and F. Malucelli, Mathematical Programming, Ser. A, accepted for publication.
-
Edge-swapping algorithms for the minimum fundamental cycle basis problem,
with L. Liberti, F. Maffioli and N. Maculan, Mathematical Methods of Operations Research, in press.
-
Optimization models and methods for planning wireless mesh networks, with A. Capone, M. Cesana, I. Filippini and F. Malucelli, Computer Networks, Vol. 52, No. 11 (2008) 2159-2171.
-
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, with M. Bruglieri and G. Casale, Computers & Operations Research, Vol. 35, No. 5 (2008) 1465-1482.
-
Radio planning and coverage optimization of 3G cellular networks, with A. Capone and F. Malucelli, ACM Wireless Networks, Vol. 14, No. 4 (2008) 435-447.
- Provisioning Virtual Private Networks under traffic uncertainty, with A. Altin, B. Belotti and M. Pinar, Networks, Vol. 49, No. 1 (2007) 100-115.
-
Optimizing base station location and configuration in UMTS networks,
with P. Belotti, A. Capone and F. Malucelli, Annals of Operations Research, Vol. 146, No. 1 (2006) 135-152
- Optimization problems and models for planning cellular networks, with. A. Capone, F. Malucelli and C. Mannino, in Handbook of Optimization in Telecommunications, P. Pardalos and M. Resende (editors), Springer, New York, 2006, 917-939.
- Boundedness theorems for the relaxation method, with R. Hauser,
Mathematics of Operations Research, Vol. 30, No. 4 (2005) 939-955.
- Randomized relaxation methods for the maximum feasible
subsystem problem, with P. Belotti and R. Hauser,
Proceedings of the 14th Integer Programming and Combinatorial
Optimization conference (IPCO'05), LNCS Vol. 3509, Springer-Verlag
(2005) 249-264.
-
On the maximum feasible subsystem problem, IISs and
IIS-hypergraphs, with M. E. Pfetsch and L. E. Trotter Jr.,
Mathematical 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 maximum feasible subsystem problem and some applications, in A. Agnetis, G
. Di Pillo, Eds., "Modelli e Algoritmi per l'Ottimizzazione di Sistemi Complessi",
Pitagora Editrice Bologna, 2003, 31-69.
-
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,
No. 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.