Giacomo Nannicini  Giacomo Nannicini photo       

contact information

Research Staff Member, Mathematical Optimization and Algorithms
Thomas J. Watson Research Center, Yorktown Heights, NY USA
  +1dash914dash945dash2933

links

Professional Associations

Professional Associations:  DIMACS  |  INFORMS  |  Mathematical Optimization Society


Current work (submitted papers, technical reports):

  • V. Austel. S. Dash, O. Gunluk, L. Horesh, L. Liberti, G. Nannicini, B. Schieber. Globally optimal symbolic regression.
  • E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, R. Wisnieff. Breaking the 49-qubit barrier in the simulation of quantum circuits. Arxiv paper 1710.05867.
  • G. Nannicini. An introduction to quantum computing, without the physics. Arxiv paper 1708.03684.
  • A. Lodi, E. Malaguti, G. Nannicini and D. Thomopulos. Nonlinear chance-constrained problems with applications to hydro scheduling.
  • A. Costa and G. Nannicini. RBFOpt: an open-source library for black-box optimization with costly function evaluations. Optimization Online paper 4538Download paper
  • N. Halman, G. Nannicini. Fully polynomial-time (Σ-Π) approximation schemes for continuous nonlinear
    newsvendor and continuous stochastic dynamic programs. Optimization Online paper 5276.
  • N. Halman, G. Nannicini. Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with
    scalar state via recursive linear programming.
  • N. Halman, G. Nannicini and J. Orlin. On the complexity of energy storage problems.  Download paper
  • G. Nannicini, E. Traversi, R. Wolfler-Calvo. A Benders squared (B^2) algorithm for infinite horizon stochastic
    linear programs.

Journal:

  • A. Costa, E. Di Buccio, M. Melucci and G. Nannicini. Efficient parameter estimation for information retrieval using black-box optimization. IEEE Transactions on Knowledge and Data Engineering, 2017. Journal link
  • A. Fokoue, G. Diaz, G. Nannicini, H. Samulowitz. An effective algorithm for hyperparameter optimization of neural networks. IBM Journal of Research and Development,  61(4-5), 2017. Download paper Journal link
  • C. D'ambrosio, G. Nannicini, G. Sartor. MILP models for the selection of a small set of well-distributed points. Operations Research Letters, 45(1):56-62, 2017. Download paper Journal link
  • J. Kalikka, X. Zhou, J. Behera, G. Nannicini, R. Simpson. Evolutionary design of interfacial phase change van der Waals heterostructures. Nanoscale, 8(42):18212-18220, 2016. Journal link
  • T. Wortmann, A. Costa, G. Nannicini, T. Schroepfer. Advantages of surrogate models for architectural design optimization. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 29(4):471-481, 2015. Journal link
  • N. Halman, G. Nannicini and J. Orlin. A computationally efficient FPTAS for convex stochastic dynamic programming. SIAM Journal on Optimization, 25(1):317-350, 2015. Download paper Journal link
  • G. Cornuejols, F. Margot and G. Nannicini. On the safety of Gomory cut generators. Mathematical Programming Computation, 5(4):345-395, 2013. Download paper Journal link
  • E. Balas, G. Cornuejols, T. Kis and G. Nannicini. Combining Lift-and-Project and Reduce-and-Split. INFORMS Journal on Computing, 25(3):475-487, 2013. Download paper Journal link
  • G. Cornuejols, C. Michini, G. Nannicini. How tight is the corner relaxation? Insights gained from the stable set problem. Discrete Optimization, 9(2):109-121, 2012. Selected by the Editorial Board for the 10 Year Anniversary Virtual Special Issue as an "excellent paper [...] over the last decade"Download paper Journal link
  • G. Nannicini and P. Belotti. Rounding based heuristics for nonconvex MINLPs. Mathematical Programming Computation, 4(1):1-31, 2012. Download paper Journal link
  • D. Delling and G. Nannicini. Core routing on dynamic time-dependent road networks. INFORMS Journal on Computing, 24(2):187-201, 2012. Download paper Journal link
  • G. Nannicini, D. Delling, D. Schultes and L. Liberti. Bidirectional A* search on time-dependent road networks. Networks, 59(2):240-251, 2012. Winner of the 2012 Glover-Klingman prize. Download paper Journal link
  • L. Liberti, G. Nannicini and N. Mladenovic. A recipe for finding good solutions to MINLPs. Mathematical Programming Computation, 3(4):349-390, 2011. Download paper Journal link
  • 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. Download paper Journal link
  • G. Cornuejols, L. Liberti and G. Nannicini. Improved strategies for branching on general disjunctions. Mathematical Programming A, 130(2):225--247, 2011. Download paper Journal link
  • G. Nannicini. Point-to-Point Shortest Paths on Dynamic Time-Dependent Road Networks (Ph.D. thesis abstract). 4OR, 8(3):327-330, 2010. Download paper Journal link
  • 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. Download paper Journal link
  • G. Nannicini and L. Liberti. Shortest paths on dynamic graphs. International Transactions in Operational Research, 15:1-13, 2008. Journal link

Selected conference papers:

  • T. Wortmann, G. Nannicini. Optimization methods for architectural design. Proceedings of the 21st Annual Conference on Computer-Aided Architecture Design Research in Asia (CAADRIA 2016), 2016.
  • A. Costa, G. Nannicini, T. Schroepfer, T. Wortmann. Black-box optimization of lighting simulation in architectural design. Proceedings of Complex Systems Design & Management Asia, pages 27-39. Springer, 2015.
  • N. Halman, G. Nannicini and J. Orlin. A computationally efficient FPTAS for convex stochastic dynamic programs. Proceedings of ESA 2013, volume 8125 of Lecture Notes in Computer Science, pages 577-588. Springer, 2013.
  • G. Nannicini, P. Belotti, J. Lee, J. Linderoth, F. Margot, A. W ̈achter. A probing algorithm for MINLP with failure prediction by SVM. Proceedings of CPAIOR 2011, volume 6697 of Lecture Notes in Computer Science, pages 154-169. Springer, 2011.
  • G. Nannicini and P. Belotti. Rounding-based heuristics for nonconvex MINLPs. Proceedings of EWMINLP, Marseille, 2010.
  • D. Delling, G. Nannicini. Bidirectional core-based routing in dynamic time-dependent road networks. Proceedings of ISAAC 08, volume 5369 of Lecture Notes in Computer Science, pages 813-824. Springer, 2008.
  • G. Nannicini, P. Baptiste, D. Krob, and L. Liberti. Fast computation of point-to-point paths on time-dependent road networks. Proceedings of COCOA 08, volume 5165 of Lecture Notes in Computer Science, pages 225-234. Springer, 2008.
  • G. Nannicini, D. Delling, L. Liberti, D. Schultes. Bidirectional A* search for time-dependent fast paths. Proceedings of WEA 2008, volume 5038 of Lecture Notes in Computer Science, pages 334-346. Springer, 2008.

 

For a full list of publicatoins, see my CV.