Giacomo Nannicini

I am Assistant Professor at the Singapore University of Technology and Design, and Visiting Scholar at MIT Sloan School of Management. My full CV can be downloaded here. My "official" faculty page (sadly, not under my control at the moment) can be found here.

Publications (not always updated, see CV):

Current work (manuscripts and submitted papers):

G. Cornuejols, C. Michini, G. Nannicini. How tight is the corner relaxation? Discrete Optimization, under review. Submitted in 2011. PDF.
E. Balas, G. Cornuejols, T. Kis and G. Nannicini. Combining Lift-and-Project and Reduce-and-Split. INFORMS Journal on Computing, under review. Submitted in 2010. PDF.

Journal:

G. Nannicini and P. Belotti. Rounding based heuristics for nonconvex MINLPs. Mathematical Programming Computation, published online, 2011. PDF.
L. Liberti, G. Nannicini and N. Mladenovic. A recipe for finding good solutions to MINLPs. Mathematical Programming Computation, 3(4):349-390, 2011. PDF.
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. PDF.
D. Delling and G. Nannicini. Core routing on dynamic time-dependent road networks. INFORMS Journal on Computing, published online, 2011. PDF.
G. Nannicini, D. Delling, D. Schultes and L. Liberti. Bidirectional A* search on time-dependent road networks. Networks, accepted for publication, 2010. PDF.
G. Nannicini. Point-to-Point Shortest Paths on Dynamic Time-Dependent Road Networks (Ph.D. thesis abstract). 4OR, 8(3):327-330, 2010. PDF.
G. Cornuejols, L. Liberti and G. Nannicini. Improved strategies for branching on general disjunctions. Mathematical Programming A, 130(2):225--247, 2011. PDF.
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. PDF.
G. Nannicini and L. Liberti. Shortest paths on dynamic graphs. International Transactions in Operational Research, 15:1-13, 2008.

Book chapters

L. Liberti, G. Nannicini and N. Mladenovic. A good recipe for solving MINLPs. MATHEURISTICS: Hybridizing metaheuristics and mathematical programming, volume 10 of Annals of Information Systems, pages 231-245. Springer, 2009.
P. Belotti, L. Liberti, A. Lodi, G. Nannicini and A. Tramontani. Disjunctive inequalities: applications and extensions. Encyclopedia of Operations Research and Management Science, J. Cochran et al. (eds.), Wiley, Hoboken, to appear. Accepted 2010.
G. Nannicini, G. Cornuejols, M. Karamanov and L. Liberti. Branching on split disjunctions. Combinatorial Optimization: Methods and Applications, V. Chvatal (ed.), pages 164-182. IOSPress, 2011.

Conferences with published proceedings:

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, to appear, 2011. PDF.
G. Nannicini and P. Belotti. Rounding-based heuristics for nonconvex MINLPs. Proceedings of EWMINLP, 2010..
G. Nannicini, D.Delling. Core Routing on Time-Dependent Networks. Proceedings of ROADEF 09, 2009.
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.

Ph.D. Thesis:

G. Nannicini. Point-to-Point Shortest Paths on Dynamic Time-Dependent Road Networks. Ph.D. Thesis, Ecole Polytechnique, 2009. Available here. Please cite this together with the abstract appeared in: 4OR, 8(3):327-330, 2010.

Other publications:

G. Nannicini, P. Belotti and L. Liberti. A local branching heuristic for MINLPs. Available at: ArXiv, paper 0812.2188.
G. Cornuejols, L. Liberti and G. Nannicini. Improved strategies for branching on general disjunctions. Proceedings of CTW 2009, Paris, 2009.
G. Nannicini, D. Delling, L. Liberti, D. Schultes. Bidirectional A* on time-dependent graphs. Proceedings of CTW 2008, Milan, 2008.
G. Nannicini, P. Baptiste, D. Krob, and L. Liberti. Fast paths in dynamic road networks. Proceedings of ROADEF 08 (long papers), Clermont-Ferrand, 2008.
G. Nannicini, P. Baptiste, D. Krob, and L. Liberti. Fast point-to-point shortest path queries on dynamic graphs with interval data. Proceedings of CTW 2007, Enschede, 2007.

Teaching (at Ecole Polytechnique):

Introduction to C++ (2008/2009, II sem): , link to the course page.
Mathematical Programming: Modeling and Applications (2008/2009, I sem): get the slides: TD1, TD3, TD7, TD8, TD9.
Introduction to C++ (2008/2009, I sem): , link to the course page.
Introduction to Computer Science - INF311 (2007/2008, II sem).
Introduction to C++ (2007/2008, II sem): link to the course page.
Operations Research (MISIC 2007/2008, I sem): get the slides and the solutions to the exercises.
Introduction to C++ (2007/2008, I sem): link to the course page.
Introduction to Computer Science - INF311 (2006/2007, II sem).
Introduction to C++ (2006/2007, II sem): link to the course page.

Laboratoire d'Informatique (LIX)
École Polytechnique
91128 Palaiseau Cedex - France

Email : giacomon[at]lix.polytechnique.fr

Tous les documents fournis le sont sous la responsabilité de leurs auteurs, et ne représentent pas nécessairement les positions officielles de l'École polytechnique. Les informations données le sont de bonne foi, mais leur véracité ne saurait être garantie.