Project Manager Design
Resume:
RESUME Pietro L. Belotti
PERSONAL DATA
Assistant Professor
Department of Mathematical Sciences
Clemson University
Clemson, SC 29634
abqmc0@r.postjobfree.com
EDUCATION
Ph.D., Politecnico di Milano, Italy, 2003, Computer Engineering.
M.Sc., Politecnico di Milano, Italy, 1999, Computer Engineering.
PROFESSIONAL REGISTRATION
Professional Engineer, Italy, 1999.
PROFESSIONAL EXPERIENCE
Clemson University, 2010-, Assistant Professor.
Lehigh University, 2008-2010, Visiting Assistant Professor.
Carnegie Mellon University, 2006-2008, Postdoctoral Fellow.
Politecnico di Milano, 2003-2006, FIRB Postdoctoral Fellow.
DISC s.r.l., Bergamo, Italy, 1999-2000, ERP software developer.
CONSULTING EXPERIENCE
Juniper Networks, Sunnyvale CA (2010), developed robust optimization model for
MPLS / OTN networks with traf c uncertainty.
MEMBERSHIPS
1. Full member, COIN - OR Foundation, 2010-.
2. Member, Mathematical Optimization Society (MOS), 2008-.
3. Member, Institute for Operations Research and the Management Sciences (IN -
FORMS ), 2007-.
PUBLICATIONS
Refereed Journal Publications
1. P. Belotti, Multicommodity network design with survivability constraints: Some
models and algorithms, 4OR 3(1), 79-81 (2005).
1
2. E. Amaldi, P. Belotti, A. Capone, F. Malucelli, Optimizing base station location
and con guration in UMTS networks, Annals of Operations Research 146(1), 135-
151 (2006).
3. P. Belotti, F. Malucelli, L. Brunetta, Multicommodity network design with discrete
node costs, Networks 49(1), 90-99 (2007).
4. A. Alt n, E. Amaldi, P. Belotti, M.C. P nar, Provisioning virtual private networks
under traf c uncertainty, Networks 49(1), 100-115 (2007).
5. S. Kucherenko, P. Belotti, L. Liberti, N. Maculan, New formulations for the kiss-
ing number problem, Discrete Applied Mathematics 155(14), 1837-1841 (2007).
6. P. Belotti, M. Labb, F. Maf oli, M. M. Ndiaye, A branch-and-cut method for the
e
obnoxious p-median problem, 4OR 5(4), 299-314 (2007).
7. P. Belotti, A. Capone, G. Carello, F. Malucelli, Multi-layer MPLS network de-
sign: the impact of statistical multiplexing, Computer Networks 52(6), 1291-1307
(2008).
8. P. Belotti, M.C. P nar, Optimal oblivious routing under linear and ellipsoidal un-
certainty, Optimization and Engineering 9(3), 257-271 (2008).
9. P. Belotti, J. Lee, L. Liberti, F. Margot, A. W chter, Branching and bounds tighten-
a
ing techniques for non-convex MINLP, Optimization Methods and Software 24(4-
5), 597-634 (2009).
10. A. Alt n, P. Belotti, M.C. P nar, OSPF routing with optimal oblivious performance
ratio under polyhedral demand uncertainty, Optimization and Engineering 11(3),
395-422 (2010).
11. P. Belotti, A.J. Miller, M. Namazifar, Linear inequalities for bounded products of
variables, SIAG/OPT Views-and-News 22(1), 1-7 (2011).
12. P. Belotti, Bound reduction using pairs of linear inequalities, Journal of Global
Optimization, DOI: 10.1007/s10898-012-9848-9 (2012).
13. G. Nannicini and P. Belotti, Rounding-based heuristics for nonconvex MINLPs,
Math. Programming Computation 4(1), 1-31 (2012).
Book chapters
1. S. Orlowski, C. Raack, A.M.C.A. Koster, G. Baier, T. Engel, P. Belotti, Branch-
and-cut techniques for solving realistic two-layer network design problems, in
A.M.C.A. Koster, X. Mu oz (eds.), Graphs and Algorithms in Communication Net-
n
works, Springer-Verlag, 95-117 (2009).
2. P. Belotti, L. Liberti, A. Lodi, G. Nannicini, A. Tramontani, Disjunctive inequali-
ties: applications and extensions. J. Cochran et al. (eds.), Encyclopedia of Opera-
tions Research and Management Science, John Wiley and Sons (2010).
3. P. Belotti, Disjunctive cuts for non-convex MINLP . J. Lee and S. Leyffer (eds.),
Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and its Ap-
plications, vol. 154, Springer, 117-144 (2012).
4. A. Qualizza, P. Belotti, F. Margot, Linear programming relaxations of quadrat-
ically constrained quadratic programs . J. Lee and S. Leyffer (eds.), Mixed Inte-
ger Nonlinear Programming, IMA Volumes in Mathematics and its Applications,
vol. 154, Springer, 407-426 (2012).
2
Conference Proceedings (Reviewed)
1. P. Belotti, T. Stidsen, Optimal placement of wavelength converting nodes, Pro-
ceedings of the Third International Workshop on Design of Reliable Communica-
tion Networks (DRCN 2001), 15-21, Budapest, Hungary (October 2001).
2. P. Belotti, F. Malucelli, Relaxation approach to network design with shared pro-
tection, Proceedings of the International Network Optimization Conference (INOC
2003), 72-77, Paris-Evry, France (October 2003).
3. P. Belotti, F. Malucelli, Row-column generation for multilayer network design,
Proceedings of the International Network Optimization Conference (INOC 2005),
422-427, Lisbon, Portugal (March 2005).
4. E. Amaldi, P. Belotti, R. Hauser, Randomized relaxation methods for the max-
imum feasible subsystem problem, Proceedings of the 11th International Con-
ference on Integer Programming and Combinatorial Optimization (IPCO 2005),
259-264, Berlin, Germany (June 2005).
5. P. Belotti, A. Capone, G. Carello, F. Malucelli, F. Senaldi, A. Totaro, MPLS over
transport network: two layer approach to network design with statistical multiplex-
ing, Proceedings of the 2nd Conference on Next Generation Internet Design and
Engineering, 333-340, Valencia, Spain (April 2006).
6. P. Belotti, A. Capone, G. Carello, F. Malucelli, F. Senaldi, A. Totaro, Design of
Multi-layer networks with traf c grooming and statistical multiplexing, Proceed-
ings of the International Network Optimization Conference (INOC 2007), Spa, Bel-
gium (April 2007).
7. G. Panza, A. Capone, D. Pinarello, P. Belotti, Robustness in next-generation net-
works, Proceedings of the ICT Summit Europe, Santander, Spain (June 2009).
8. A. Karabis, P. Belotti, D. Baltas, Optimization of catheter position and dwell time
in prostate HDR brachytherapy using HIPO and linear programming, Proceedings
of the World Congress on Medical Physics and Biomedical Engineering, 612-615,
Munich, Germany (September 2009).
9. P. Belotti, S. Ca eri, J. Lee, L. Liberti, Feasibility-based bounds tightening via
xed points, Proceedings of the 4th Annual International Conference on Combi-
natorial Optimization and Applications (COCOA 2010), Big Island, Hawaii (De-
cember 2010).
10. G. Nannicini, P. Belotti, J. Lee, J. Linderoth, F. Margot, A. W chter, A Probing
a
Algorithm for MINLP with Failure Prediction by SVM, Proceedings of the eighth
International Conference on Integration of Arti cial Intelligence (AI) and Opera-
tions Research (OR) techniques in Constraint Programming (CPAIOR 2011), 154-
169, Berlin, Germany (June 2011).
11. N. Touati-Moungla, P. Belotti, V. Jost, L. Liberti, A Branch-and-Price Algorithm
for the Risk-Equity Constrained Routing Problem . In J. Pahl, T. Reiners, S. Vo
(eds.), Network Optimization, Lecture Notes in Computer Science 6701, 439-449,
Springer Berlin/Heidelberg (2011).
PRESENTATIONS
Invited talks
1. P. Belotti, F. Malucelli, Shared protection network design through Lagrangian re-
g
laxation, Bo azici Universitesi, Istanbul, Turkey (October 3, 2003).
3
2. P. Belotti, C. Spinelli, E. Pedrinelli, M. Fumagalli, V. Mascolo, Evolution of traf-
c demand and dimensioning a metro-regional transport network, Fotonica 2005,
Trani, Italy (May 30, 2005).
3. P. Belotti, P. Bonami, J. Lee, F. Margot, A. W chter, A Coin-OR tool for mixed-
a
integer non-convex programming, University of New York at Buffalo (January 26,
2007).
4. P. Belotti, L. Biegler, I. Grossmann, P. Bonami, J. Lee, A. W chter, L. Liberti,
a
F. Margot, Branching rules for nonconvex MINLP, Workshop on Mixed Integer
Nonlinear Programming, Institute for Mathematics and its Application, University
of Minnesota, Minneapolis (November 18, 2008).
5. P. Belotti, J. Lee, L. Liberti, F. Margot, A. W chter, Disjunctions in MINLP:
a
branching techniques and disjunctive cuts, Workshop on Mixed Integer Program-
ming, University of California at Berkeley (June 11, 2009).
6. P. Belotti, Finding postdocs, Packer House, Lehigh University, Bethlehem PA
(November 16, 2009).
7. P. Belotti, A.J. Miller, M. Namazifar, Valid inequalities for sets de ned by multi-
linear functions, European Workshop on Mixed Integer Nonlinear Programming,
LIF, Universit de Marseille, France (April 12, 2010).
e
8. P. Belotti, A.J. Miller, M. Namazifar, Valid inequalities for sets de ned by mul-
tilinear functions, Toulouse Conference on Global Optimization (TOGO), EN -
SEEIHT, Toulouse, France (September 3, 2010) plenary talk.
9. P. Belotti, Couenne, an Open-Source solver for non-convex Mixed Integer Non-
linear Optimization, seminar series in Industrial Optimization, the Fields Institute,
Toronto (ON), Canada (October 5, 2010).
10. P. Belotti, Network optimization under uncertainty using statistical multiplexing,
i2Cat, Barcelona (April 4, 2011).
Contributed talks
1. P. Belotti, T. Stidsen, Reducing blocking probability with wavelength conversion,
Conference of the Italian Operations Research Association (AIRO 2001), Villasi-
mius (CA), Italy (September 7, 2001).
2. P. Belotti, F. Malucelli, 1:1 and 1:n shared protection in WDM networks, Confer-
ence of the Italian Operations Research Association (AIRO 2002), L Aquila, Italy
(September 2002).
3. P. Belotti, L. Brunetta, F. Malucelli, Multifacility models for node cost network de-
sign, Workshop of the Italian Operations Research Association (AiroWinter 2003),
Champoluc-Ayas, Italy (February 2003).
4. P. Belotti, F. Malucelli, Shared protection network design through Lagrangian re-
laxation, Department of Industrial Engineering, Bilkent University, Ankara, Turkey
(September 26, 2003).
5. P. Belotti, F. Malucelli, Shared protection network design through Lagrangian re-
laxation, ECCO XVI Molde, Norway (June 5, 2003).
6. A. Alt n, E. Amaldi, P. Belotti, M.C. P nar, Multicommodity network design un-
der traf c uncertainty, Department of Industrial Engineering, Bilkent University,
Ankara, Turkey (September 30, 2004).
7. E. Amaldi, P. Belotti, R. Hauser, Randomized relaxation methods for the Maxi-
mum Feasible Subsystem problem, Conference of the Italian Operations Research
Association (AIRO 2004), Lecce, Italy (September 8, 2004).
4
8. P. Belotti, A. Capone, G. Carello, F. Malucelli, Exploiting statistical multiplexing
in the design of packet networks, Universit` di Pisa (November 2004).
a
9. P. Belotti, F. Malucelli, Network design with grooming constraints, CTW 2004,
Loveno di Menaggio, Italy (June 2, 2004).
10. P. Belotti, F. Malucelli, Row and column generation for multi-layer network de-
sign, OR 2004, Tilburg (September 3, 2004).
11. P. Belotti, L. Brunetta, F. Malucelli, Valid inequalities for a non-linear node cost
network design problem, Conference of the Italian Operations Research Associa-
tion (AIRO 2004), Lecce, Italy (September 8, 2004).
12. A. Alt n, E. Amaldi, P. Belotti, M.C. P nar, Multicommodity network design un-
der traf c uncertainty . IBM T.J. Watson Research Center, Yorktown Heights, NY
(December 1, 2005).
13. E. Amaldi, P. Belotti, R. Hauser, Randomized relaxation methods for the maxi-
mum feasible subsystem problem . Department of Industrial Engineering, Bilkent
University, Ankara, Turkey (October 14, 2005).
14. E. Amaldi, P. Belotti, R. Hauser, Randomized relaxation methods for the Maxi-
mum Feasible Subsystem problem, Middle East Technical University (October 12,
2005).
15. E. Amaldi, P. Belotti, R. Hauser, Randomized relaxation methods for the Max-
imum Feasible Subsystem problem, Workshop on Integer Programming, IMA,
University of Minnesota, Minneapolis (July 27, 2005).
16. P. Belotti, S. Orlowski, Methods for multi-layer network design, Cost 293 Meet-
ing, Universitat Polit` cnica de Catalunya, Barcelona (September 30, 2005).
e
17. P. Belotti, M.C. P nar, Optimal oblivious routing under statistical uncertainty .
Konrad Zuse Zentrum f r Informationstechnik, Berlin (November 17, 2005).
u
18. E. Amaldi, P. Belotti, On randomized relaxation methods for the maximum feasi-
ble subsystem problem, International Symposium on Mathematical Programming,
Rio de Janeiro, Brasil (August 3, 2006).
19. E. Amaldi, P. Belotti, R. Hauser, On randomized relaxation methods for the max-
imum feasible subsystem problem, Tepper School of Business, Carnegie Mellon
University (November 3, 2006).
20. E. Amaldi, P. Belotti, R. Hauser, On Randomized relaxation methods for the maxi-
mum feasible subsystem problem . Workshop in Combinatorial Optimization, Aus-
sois (January 12, 2006).
21. P. Belotti, S. Orlowski, Methods for multi-layer network design, LIX, Ecole Poly-
technique (September 2006).
22. P. Belotti, P. Bonami, J. Lee, F. Margot, A. W chter, A Coin-OR tool for mixed-
a
integer non-convex programming, CAPD meeting, Department of Chemical Engi-
neering, Carnegie Mellon University (March 6, 2007).
23. P. Belotti, P. Bonami, J. Lee, F. Margot, A. W chter, An Open Source software
a
for non-convex MINLP, ICCOPT-MOPTA 2007, McMaster University, Hamilton,
Canada (August 14, 2007).
24. P. Belotti, P. Bonami, J. Lee, F. Margot, A. W chter, A spatial branch-and-bound
a
for mixed-integer non-convex programming, IBM T.J. Watson Research Center
(May 18, 2007).
25. P. Belotti, A. Saxena, Probabilistic network design: a computational study, IN-
FORMS 2007, Seattle (November 7, 2007).
26. P. Belotti, P. Bonami, J. Lee, F. Margot, A. W chter, A reformulation-based branch-
a
and-bound for non-convex MINLPs, INFORMS 2007, Seattle (November 7, 2007).
5
27. P. Belotti, P. Bonami, J. Lee, F. Margot, A. W chter, Spatial branch-and-bound al-
a
gorithms for non-convex MINLPs, INFORMS 2007, Seattle (November 6, 2007).
28. P. Belotti, F. Margot, G. Cornu jols, J. Lee, A. W chter, L. Biegler, I. Grossmann,
e a
P. Bonami, L. Liberti, An Open Source exact solver for Nonconvex Mixed-Integer
Nonlinear problems, McMaster University (June 23, 2008).
29. P. Belotti, F. Margot, Disjunctive cuts for nonconvex MINLP, INFORMS, Wash-
ington D.C. (October 11, 2008).
30. P. Belotti, J. Lee, L. Liberti, F. Margot, A. W chter, Branching techniques for
a
nonconvex MINLP, INFORMS, Washington D.C. (October 15, 2008).
31. P. Belotti, Mixed-integer nonconvex problems: an MILP perspective, Department
of Mechanical Engineering, University of Wisconsin at Madison (September 11,
2008).
32. P. Belotti, C. Latifo lu, L.V. Snyder, Production planning with uncertain power
g
supply, EWO Meeting, Carnegie Mellon University, Pittsburgh PA (September 29,
2009).
33. P. Belotti, I. P lik, J. Wang, Convex relaxation methods for non-convex optimiza-
o
tion, International Symposium on Mathematical Programming, Chicago (August
24, 2009).
34. P. Belotti, J. Lee, L. Liberti, F. Margot, A. W chter, Branching techniques and
a
valid inequalities for mixed-integer nonconvex programming, 4th International
Conference on High Performance Scienti c Computing, Hanoi, Vietnam (March
6, 2009).
35. P. Belotti, J. Lee, L. Liberti, F. Margot, A. W chter, Disjunctions in non-convex
a
MINLP: branching and inequalities, Institut de Math matiques, Universit Bor-
e e
deaux 1 (December 15, 2009).
36. P. Belotti, J. Lee, L. Liberti, F. Margot, A. W chter, Disjunctions in non-convex
a
MINLP: branching and inequalities, Konrad Zuse Zentrum f r Informationstech-
u
nik, Berlin (July 7, 2009).
37. P. Belotti, A.J. Miller, M. Namazifar, Valid inequalities for bounded multilinear
functions, Workshop on Integer Programming and Combinatorial Optimization,
Aussois, France (January 5, 2010).
38. P. Belotti, A.J. Miller, M. Namazifar, Valid inequalities for bounded multilinear
sets, Clemson University, Clemson SC (February 11, 2010).
39. P. Belotti, A.J. Miller, M. Namazifar, Valid inequalities for bounded multilinear
sets, Lehigh University, Bethlehem PA (February 28, 2010).
40. P. Belotti, K. Kompella, L. Noronha, Network provisioning under uncertainty:
OTN, MPLS, and statistical multiplexing, Transport Network Strategies, Warsaw,
Poland (September 22, 2010).
41. P. Belotti, A.J. Miller, M. Namazifar, Lower and Upper Bounding Techniques in
Couenne, INFORMS annual conference, Austin TX (November 8, 2010).
42. P. Belotti, Bound reduction using pairs of linear inequalities, SIAM Conference
on Optimization, Darmstadt, Germany (May 16, 2011).
HONORS AND AWARDS
1. 2010: COIN - OR INFORMS Cup on the best COIN - OR software for Optimization,
awarded to Couenne.
6
2. Best paper award, G. Panza, A. Capone, D. Pinarello, P. Belotti, Robustness in
next-generation networks. In ICT Summit Europe 2009, Santander, Spain, 10-12
June 2009.
3. Honorable mention, Camerini-Carraresi prize for the best M.Sc. thesis in Opera-
tions Research, Italy, 1998.
SPONSORED RESEARCH
1. Computational models and algorithms for enterprise-wide optimization of pro-
cess industries, PITA Pennsylvania Infrastructure Technology Alliance, Co-P.I.,
$19,250 ($14,656), (2009).
2. Capacity planning for a gases supply chain with network disruptions and inter-
ruptible power, PITA Pennsylvania Infrastructure Technology Alliance, Co-P.I.,
$33,000 ($21,258), (2009).
OTHER SPONSORED ACTIVITY
1. Travel grant, COST Action 293 of the European Community, e2,000 (2005).
2. Travel grant, the Scienti c and Technological Research Institution of Turkey and
the Italian Research Council, e2,000 (2003-2004).
3. Travel grant, Ericsson ONER Laboratory, Stockholm, and Link ping Universitet,
o
Sweden, SEK 25,000 or $3,300 (2001).
SUBMITTED PROPOSALS
1. Optimization models for robust MPLS/OTN network design, Juniper Networks
Inc., P.I., $78,074 (2011).
2. Algorithms for mixed integer conic optimization, National Science Foundation,
co-P.I., $211,442 (2011).
3. Algorithms for Optimization on Polynomials, Department of Energy, Early Ca-
reer Research Program. P.I., $750,000 (2011).
4. Algorithms for global optimization with polynomial constraints, National Sci-
ence Foundation CAREER program, P.I., $591,439 (2011).
5. Parallel solvers for discrete nonlinear optimization, Google Inc., P.I., $72,548
(2011).
6. Computational methods for discrete conic optimization, National Science Foun-
dation, co-P.I., $202,869 (2010).
GRADUATE STUDENT ADVISING
PhD students
Advising
1. Ca r Latifo lu, Production planning under uncertainty, Lehigh University, 2012
g g
(expected). Co-supervisor: Larry V. Snyder, Lehigh University.
7
Committee member
1. Ban Kawas, Lehigh University (2010).
2. Daniel Scansaroli, Lehigh University (2009-2011).
3. Julio G ez, Lehigh University (exp. 2012).
o
4. Lakmali P. Weerasena, Dept. of Mathematical Sciences.
MS students
Advising
1. Arti Ramanathan, Analysis of a shared protection network design problem, Dept.
of Industrial & Systems Engineering, Lehigh University, 2010.
2. Nada Es-Sakli, Column generation techniques for the graph K -clustering prob-
lem, Dept. of Industrial & Systems Engineering, Lehigh University, 2010.
3. Ruobing Shen, Rounding cuts for nonlinear integer optimization problems, Dept.
of Mathematical Sciences, since 2011.
4. Cameron Megaw, Branching rules for multicommodity ow problems, Dept. of
Mathematical Sciences, since 2011.
5. Suo Mei, Convex relaxations for Quadratic Optimization problems with linear
constraints, Dept. of Mathematical Sciences, since 2011.
Committee member
1. Chris Paribello;
2. Jason Joyner;
3. Lucas Waddell;
4. Jeannette Brown (graduated December 2011);
5. Maura Hendsey (graduated May 2011);
6. Maria Stopak (graduated May 2011);
7. Kate Ritchey (graduated May 2011);
TEACHING
Courses Taught
1. MthSc365, Numerical Methods for Engineers, F11, s12.
2. MthSc810, Mathematical Programming, F11.
3. MthSc101, Essential Mathematics for the Informed Society, S11.
4. MthSc811, Nonlinear Programming, S11, S12.
5. MthSc440/H440/640, Linear Programming, F10.
6. IE341, Data communication systems analysis and design, S09, S10.
7. IE172, Algorithms for systems engineering, S09, S10.
8. IE426, Optimization models and applications, F08, F09.
9. Introduction to Operations Research, S05.
10. The C++ programming language, S01.
11. Unix system programming, S01.
New Course Development
Design of telecommunication networks, S04, S05.
8
UNIVERSITY AND PUBLIC SERVICE
External
1. Since 2011: Associate editor for RAIRO-OR (Cambridge).
2. Chair, organizing committee, COIN - OR INFORMS Cup 2011, to be awarded at the
Annual INFORMS Conference in Charlotte NC November 13, 2011.
3. Since 2010: Editor, INFORMS Optimization Society web page.
http://www.informs.org/Community/Optimization-Society
4. Member, organizing committee, Modeling and OPtimization: Theory and Applica-
tions (MOPTA), Lehigh University (2009 and 2010).
5. Member, organizing committee, Workshop on interval analysis, constraint propa-
gation, applications, Constraint Programming 2009, September 20-24, 2009.
6. Co-chair, organizing committee, one-day workshop on Hybrid Methods for Nonlin-
ear Combinatorial Problems. Organized within CPAIOR, Berlin, May 23-27, 2011.
7. Member, organizing committee, one-day workshop on Open Source Tools for Con-
straint Programming and Mathematical Programming. Organized within CPAIOR,
Bologna, Italy, 14-18 June 2010.
8. Member, organizing committee, one-day Workshop on Hybrid Methods for Nonlin-
ear Combinatorial Problems. Organized within the CPAIOR conference, Bologna,
Italy, 14-18 June 2010.
9. Chair, organizing committee, BR-OPT: Bound Reduction for Mixed Integer Non-
linear Programming. CPAIOR conference, Carnegie Mellon University, Pittsburgh
PA, 27-31 May 2009.
10. Member, steering committee, Cyber-infrastructure for Mixed Integer Nonlinear
Programming, (http://www.minlp.org), 2008-.
11. 2008-: Technical editor, Mathematical Programming Computation (Springer).
12. 2001-: Served as a referee for the following journals:
Operations Research;
SIAM Journal on Optimization;
Mathematical Programming A;
Mathematical Programming B;
Mathematical Programming Computation;
INFORMS Journal on Computing;
Discrete Applied Mathematics;
Journal of Global Optimization;
Networks;
European Journal of Operational Research;
Operations Research Letters;
Optimization and Engineering;
Optimization Methods & Software;
4OR;
Mathematical models of Operations Research;
Computational Optimization & Applications;
Telecommunication Systems;
Computer Networks;
the AIChE Journal;
for the International Network Optimization Conference (INOC) and the European
Symposium on Algorithms (ESA).
9
Internal
1. 2000-2006: Supervisor, ORLAB the Operations Research laboratory at the De-
partment of Electronics and Computer Science, Politecnico di Milano.
2. Technical supervision, Recon gurable Engineering Educational Facility (REEF) lab-
oratory for undergraduate students, ISE Dept., Lehigh University (2008-09).
3. Member, Graduate Student admissions, Lehigh University (2008-10).
4. Member, qualifying exam committee, Brian Holder and Jiadong Wang, Lehigh Uni-
versity (2009).
5. Coordinator, OR subfaculty, Dept. of Mathematical Sciences.
MISCELLANEOUS
Software.
1. Project manager and main developer/maintainer of Couenne, an Open-Source soft-
ware for Mixed Integer Nonlinear Optimization (2006-). Actively used in the Opti-
mization community, available as an online solver on the Neos servers for optimiza-
tion at http://neos.mcs.anl.gov/neos/solvers and with a growing list of
users and contributors. See also https://projects.coin-or.org/Couenne.
2. Developer of RTR, a parallel implementation of a randomized, thermal relaxation
method for the Maximum Feasible Subsystem (MaxFS) problem, the problem of
nding, in an infeasible system of linear inequalities, a feasible subsystem with as
many inequalities as possible. Tested with an IBM BlueGene/L supercomputer on
large instances (up to 18 millions of constraints) of M AX FS arising in elds such as
Machine Learning, Telecommunications, and Computational Biology. Submitted to
the COIN - OR repository for distribution as open source software.
Revised February 27, 2012
10
Contact this candidate