Giacomo Nannicini

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.

Publications:

Current work:

• G. Cornuejols and G. Nannicini. On families of split cuts that can be generated efficiently. Submitted.
• G. Nannicini and P. Belotti. Rounding-based heuristics for nonconvex MINLPs. Submitted.
• D. Delling and G. Nannicini. Core routing on dynamic time-dependent road networks. Submitted. Available at: Optimization Online, paper 2164.
• G. Nannicini, D. Delling, D. Schultes and L. Liberti. Bidirectional A* search on time-dependent road networks. Submitted. Available at: Optimization Online, paper 2154.

Journal:

• G. Cornuejols, L. Liberti and G. Nannicini. Improved strategies for branching on general disjunctions. Mathematical Programming A, to appear. Available at: Optimization Online, paper 2071.
• G. Nannicini and L. Liberti. Shortest paths on dynamic graphs. International Transactions in Operational Research, 15:1-13, 2008.
• G. Nannicini, P. Baptiste, G. Barbier, D. Krob, and L. Liberti. Fast paths in large-scale dynamic road networks. Computational Optimization and Applications, to appear, 2008.

Conferences with published proceedings:

• L. Liberti, G. Nannicini, N. Mladenovic. A good recipe for solving MINLPs. MATHEURISTICS: Hybridizing metaheuristics and mathematical programming , volume 10 of Annals of Information Systems. Springer, 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.

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.