Giacomo Nannicini
Giacomo Nannicini
IBM T. J. Watson
Email verificata su - Home page
Citata da
Citata da
Bidirectional A  ∗  Search for Time-Dependent Fast Paths
G Nannicini, D Delling, L Liberti, D Schultes
International Workshop on Experimental and Efficient Algorithms, 334-346, 2008
Qiskit: An open-source framework for quantum computing
G Aleksandrowicz, T Alexander, P Barkoutsos, L Bello, Y Ben-Haim, ...
Accessed on: Mar 16, 2019
Breaking the 49-qubit barrier in the simulation of quantum circuits
E Pednault, JA Gunnels, G Nannicini, L Horesh, T Magerlein, ...
arXiv preprint arXiv:1710.05867, 2017
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks, 2010
RBFOpt: an open-source library for black-box optimization with costly function evaluations
A Costa, G Nannicini
Mathematical Programming Computation 10 (4), 597-629, 2018
Bidirectional core-based routing in dynamic time-dependent road networks
D Delling, G Nannicini
International Symposium on Algorithms and Computation, 812-823, 2008
Rounding-based heuristics for nonconvex MINLPs
G Nannicini, P Belotti
Mathematical Programming Computation 4 (1), 1-31, 2012
Core routing on dynamic time-dependent road networks
D Delling, G Nannicini
INFORMS Journal on Computing 24 (2), 187-201, 2012
An effective algorithm for hyperparameter optimization of neural networks
GI Diaz, A Fokoue-Nkoutche, G Nannicini, H Samulowitz
IBM Journal of Research and Development 61 (4/5), 9: 1-9: 11, 2017
Advantages of surrogate models for architectural design optimization
T Wortmann, A Costa, G Nannicini, T Schroepfer
Artificial Intelligence for Engineering Design, Analysis and Manufacturing …, 2015
A recipe for finding good solutions to MINLPs
L Liberti, N Mladenović, G Nannicini
Mathematical Programming Computation 3 (4), 349-390, 2011
Point-to-point shortest paths on dynamic time-dependent road networks
G Nannicini
4OR 8 (3), 327-330, 2010
A good recipe for solving MINLPs
L Liberti, G Nannicini, N Mladenović
Matheuristics, 231-244, 2009
Fast paths in large-scale dynamic road networks
G Nannicini, P Baptiste, G Barbier, D Krob, L Liberti
Computational Optimization and Applications 45 (1), 143-158, 2010
Leveraging secondary storage to simulate deep 54-qubit sycamore circuits
E Pednault, JA Gunnels, G Nannicini, L Horesh, R Wisnieff
arXiv preprint arXiv:1910.09534, 2019
Shortest paths on dynamic graphs
G Nannicini, L Liberti
International Transactions in Operational Research 15 (5), 551-563, 2008
Improved strategies for branching on general disjunctions
G Cornuéjols, L Liberti, G Nannicini
Mathematical Programming, 225-247, 2011
Are genetic algorithms really the best choice for building energy optimization?
T Wortmann, C Waibel, G Nannicini, R Evins, T Schroepfer, J Carmeliet
Proceedings of the Symposium on Simulation for Architecture and Urban Design …, 2017
Black-box optimization for architectural design: An overview and quantitative comparison of metaheuristic, direct search, and model-based optimization methods
T Wortmann, G Nannicini
Living Systems and Micro-Utopias, 177-186, 2016
A local branching heuristic for MINLPs
G Nannicini, P Belotti, L Liberti
ArXiv e-prints, 2008
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20