( en | de | ru )

 

Disambiguation of "Nannicini, Giacomo"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.

, , , and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 225-234. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Giacomo Ricciarelli

Giacomo D'Antonio

Giacomo Fornari

Giacomo Gazzaniga

Giacomo D'Antonio

 

Other publications of authors with the same name

Shortest paths on dynamic graphs., and . ITOR, 15 (5): 551-563 (2008)A Benders squared (B2) framework for infinite-horizon stochastic linear programs., , and . Math. Program. Comput., 13 (4): 645-681 (2021)Rounding-based heuristics for nonconvex MINLPs., and . Math. Program. Comput., 4 (1): 1-31 (2012)Fast quantum subroutines for the simplex method.. CoRR, (2019)Combining Lift-and-Project and Reduce-and-Split., , , and . INFORMS J. Comput., 25 (3): 475-487 (2013)Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions., , , , and . QCE, page 112-122. IEEE, (2021)A Probing Algorithm for MINLP with Failure Prediction by SVM., , , , , and . CPAIOR, volume 6697 of Lecture Notes in Computer Science, page 154-169. Springer, (2011)Branching on Split Disjunctions., , , and . Combinatorial Optimization - Methods and Applications, volume 31 of NATO Science for Peace and Security Series - D: Information and Communication Security, IOS Press, (2011)On the complexity of energy storage problems., , and . Discret. Optim., (2018)Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks., , , and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 225-234. Springer, (2008)