Giacomo NANNICINI
Assistant Professor
Biography
I pursued a Master's degree in Computer Engineering from the University of Florence and a Ph.D. in Computer Science at Ecole Polytechnique in Paris. I held visiting positions at the Tepper School of Business of Carnegie Mellon University (2 years) and at the Sloan School of Management at MIT (1 year).
 
My main research interests lie in the numerical solution of combinatorial optimization problems arising from a number of applications, and in mathematical programming. My focus has been in integer programming and in transportation problems. I like to complement theoretical advancements with the use of modern computational resources, such as parallel computers, that enable the solution of problems that had been thought impossible to solve. I try to collaborate with the industry as much as possible.
Education
  • PhD Computer Science, Ecole Polytechnique, France, 2009
  • MSc Computer Engineering, University of Florence, Italy, 2006
  • BSc Computer Engineering, University of Florence, Italy, 2004
Awards and achievements
  • IBM Postdoctoral Research Fellowship (in collaboration with Carnegie Mellon University), 2010
  • 2nd prize at "Prix de l'innovation de l'Ecole Polytechnique", for the best series of patents leading to technology transfer, 2009
  • CIFRE scolarship for supporting graduate studies at Ecole Polytechnique (in collaboration with Mediamobile), 2006
Selected publications
  • G. Cornuejols, C. Michini, G. Nannicini. How tight is the corner relaxation? Insights gained from the stable set problem. Discrete Optimization, to appear. Accepted in 2012.
  • G. Nannicini and P. Belotti. Rounding based heuristics for nonconvex MINLPs. Mathematical Programming Computation, published online, 2011.
  • G. Nannicini, P. Belotti, J. Lee, J. Linderoth, F. Margot, A. Waechter. A probing algorithm for MINLPs with failure detection by SVM. Proceedings of CPAIOR '11, LNCS 6697, 104-116, 2011.
  • L. Liberti, G. Nannicini and N. Mladenovic. A recipe for finding good solutions to MINLPs. Mathematical Programming Computation, 3(4):349-390, 2011.
  • G. Cornuejols and G. Nannicini. Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Mathematical Programming Computation, 3(4):281-318, 2011.
  • D. Delling and G. Nannicini. Core routing on dynamic time-dependent road networks. INFORMS Journal on Computing, published online, 2011. 
  • G. Nannicini, D. Delling, D. Schultes and L. Liberti. Bidirectional A* search on time-dependent road networks. Networks, 59(2):240-251, 2012. 
  • G. Cornuejols, L. Liberti and G. Nannicini. Improved strategies for branching on general disjunctions. Mathematical Programming A, 130(2):225--247, 2011. 
  • G. Nannicini, P. Baptiste, G. Barbier, D. Krob, and L. Liberti. Fast paths in large-scale dynamic road networks. Computational Optimization and Applications, 45(1):143-158, 2010. 

Areas of expertise

  • Integer programming
  • Combinatorial optimization
  • Computational optimization
  • Parallel computing