[Picture]         Pietro Belotti
 Tepper School of Business,
 Carnegie Mellon University
 5000 Forbes Ave., Pittsburgh PA
     Room: 315A, GSIA
Phone: +1 (412) 268 5974
email:

Short bio

Apr. 1999: Laurea in Computer Engineering, Politecnico di Milano, Italy.
Apr. 2003: PhD (Dottorato di Ricerca) in Computer Engineering, DEI, Politecnico di Milano, Italy.
2003 - 2006: Postdoc. DEI, Politecnico di Milano, Italy.
2006 - now: Postdoctoral fellow. OR group, Tepper School of Business, Carnegie Mellon University.

CV, publications.

Research interests

Mixed-Integer Nonlinear Programming (MINLP): Algorithms for the solution of Non-Convex MINLP problems. Convexification techniques, upper bounding methods.
Multicommodity Network design: shared protection constraints, step-wise node cost functions, uncertainty in the traffic demand, OSPF routing, multi-layer structure. Bundle methods, Column generation, Cutting planes, Second-order Cone programming, and Branch&Price algorithms.
Maximum feasible subsystem (MaxFS): A Thermal Randomized Relaxation method applied to large, infeasible systems of linear inequalities.
Obnoxious p-median: Location with a maxi-sum-min cost function. Tabu search and Branch-and-cut approaches with three families of valid inequalities.

Publications

Submitted
  • A. Altin, P. Belotti, and M.Ç. Pinar, "OSPF Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty," 2006, Discrete Applied Mathematics (pdf)
    Journals
  • P. Belotti, A. Capone, G. Carello, F. Malucelli, "Multi-layer MPLS Network Design: the Impact of Statistical Multiplexing," Computer Networks 52 (6), 2008, pp. 1125-1342 (link).
  • P. Belotti, M.Ç. Pinar, "Optimal oblivious routing under linear and ellipsoidal uncertainty," Optimization and Engineering. (link)
  • A. Altin, E. Amaldi, P. Belotti, M.Ç. Pinar, "Provisioning Virtual Private Networks under Traffic Uncertainty", 2005, Networks 49 (1), pp. 100-115, 2007 (link).
  • E. Amaldi, P. Belotti, R. Hauser, "Randomized relaxation methods for the maximum feasible subsystem problem". Proceedings, IPCO XI, Berlin 2005. Lecture Notes in Computer Science 3509, pp. 249-264, 2005 (link).
  • E. Amaldi, P. Belotti, A. Capone, F. Malucelli, "Optimizing base station location and configuration in UMTS networks," Annals of Operations Research 146 (1), pp. 135-151, 2006 (link).
  • P. Belotti, L. Brunetta, F. Malucelli, "Multicommodity network design with discrete node costs," Networks 49 (1), pp. 100-115, 2007 (link).
  • S. Kucherenko, P. Belotti, L. Liberti, N. Maculan, "New formulations for the Kissing Number Problem," Discrete Applied Mathematics 155 (14), pp. 1837-1841 (link).
  • P. Belotti, M. Labbé, F. Maffioli, M.M. Ndiaye, "A branch-and-cut method for the Obnoxious p-Median problem". 4OR 5(4), pp. 299-314, (link).
  • P. Belotti, "Multicommodity network design with survivability constraints: some models and algorithms," 4OR 3, pp. 79-81, 2005 (link).
    Working papers
  • P. Belotti, F. Malucelli, "A Lagrangian Relaxation approach to network design with Shared Protection". Presented at INOC 2003, Paris-Evry (France). (pdf)
  • P. Belotti, A. Saxena, "Network Design with probabilistic traffic demands: a branch-and-cut approach."
    Dedicated to Lorenzo C.