Fast point-to-point shortest path queries on dynamic road networks with interfal data. - Giacomo Nannicini; Philippe Baptiste; Daniel Krob; Leo Liberti (CTW, 2007)

Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. - Giacomo Nannicini; Philippe Baptiste; Daniel Krob; Leo Liberti (COCOA, 2008)

Bidirectional A* on Time-dependent Graphs. - Giacomo Nannicini; Daniel Delling; Leo Liberti; Dominik Schultes (CTW, 2008)

Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. - Daniel Delling; Giacomo Nannicini (ISAAC, 2008)

Bidirectional A* Search for Time-Dependent Fast Paths. - Giacomo Nannicini; Daniel Delling; Leo Liberti; Dominik Schultes (WEA, 2008)

Shortest paths on dynamic graphs. - Giacomo Nannicini; Leo Liberti (Int. Trans. Oper. Res., 2008)

Point-to-point shortest paths on dynamic time-dependent road networks. - Giacomo Nannicini (2009)

Point-to-point shortest paths on dynamic time-dependent road networks. - Giacomo Nannicini (4OR, 2010)

Fast paths in large-scale dynamic road networks. - Giacomo Nannicini; Philippe Baptiste; Gilles Barbier; Daniel Krob; Leo Liberti (Comput. Optim. Appl., 2010)

A Good Recipe for Solving MINLPs. - Leo Liberti; Giacomo Nannicini; Nenad Mladenovic (Matheuristics, 2010)

A Probing Algorithm for MINLP with Failure Prediction by SVM. - Giacomo Nannicini; Pietro Belotti; Jon Lee 001; Jeff T. Linderoth; François Margot; Andreas Wächter (CPAIOR, 2011)

Improved strategies for branching on general disjunctions. - Gérard Cornuéjols; Leo Liberti; Giacomo Nannicini (Math. Program., 2011)

Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. - Gérard Cornuéjols; Giacomo Nannicini (Math. Program. Comput., 2011)

A recipe for finding good solutions to MINLPs. - Leo Liberti; Nenad Mladenovic; Giacomo Nannicini (Math. Program. Comput., 2011)

Branching on Split Disjunctions. - Giacomo Nannicini; Gérard Cornuéjols; Miroslav Karamanov; Leo Liberti (Combinatorial Optimization - Methods and Applications, 2011)

How tight is the corner relaxation? Insights gained from the stable set problem. - Gérard Cornuéjols; Carla Michini; Giacomo Nannicini (Discret. Optim., 2012)

Core Routing on Dynamic Time-Dependent Road Networks. - Daniel Delling; Giacomo Nannicini (INFORMS J. Comput., 2012)

Rounding-based heuristics for nonconvex MINLPs. - Giacomo Nannicini; Pietro Belotti (Math. Program. Comput., 2012)

Bidirectional A* search on time-dependent road networks. - Giacomo Nannicini; Daniel Delling; Dominik Schultes; Leo Liberti (Networks, 2012)

Combining Lift-and-Project and Reduce-and-Split. - Egon Balas; Gérard Cornuéjols; Tamás Kis; Giacomo Nannicini (INFORMS J. Comput., 2013)

On the safety of Gomory cut generators. - Gérard Cornuéjols; François Margot; Giacomo Nannicini (Math. Program. Comput., 2013)

Black-Box Optimization of Lighting Simulation in Architectural Design. - Alberto Costa; Giacomo Nannicini; Thomas Schroepfer; Thomas Wortmann (CSDM Asia, 2014)

Advantages of surrogate models for architectural design optimization. - Thomas Wortmann; Alberto Costa; Giacomo Nannicini; Thomas Schroepfer (Artif. Intell. Eng. Des. Anal. Manuf., 2015)

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. - Nir Halman; Giacomo Nannicini; James B. Orlin (SIAM J. Optim., 2015)

An effective algorithm for hyperparameter optimization of neural networks. - Gonzalo I. Diaz; Achille Fokoue-Nkoutche; Giacomo Nannicini; Horst Samulowitz (IBM J. Res. Dev., 2017)

MILP models for the selection of a small set of well-distributed points. - Claudia D'Ambrosio; Giacomo Nannicini; Giorgio Sartor (Oper. Res. Lett., 2017)

Straggler Mitigation by Delayed Relaunch of Tasks. - Giacomo Nannicini (SIGMETRICS Perform. Evaluation Rev., 2017)

Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization (Extended Abstract). - Alberto Costa; Emanuele Di Buccio; Massimo Melucci; Giacomo Nannicini (ICDE, 2018)

Performance of hybrid quantum/classical variational heuristics for combinatorial optimization. - Giacomo Nannicini (CoRR, 2018)

On the complexity of energy storage problems. - Nir Halman; Giacomo Nannicini; James B. Orlin (Discret. Optim., 2018)

Optimizing allocation in a warehouse network. - Enrico Malaguti; Giacomo Nannicini; Dimitri Thomopulos (Electron. Notes Discret. Math., 2018)

RBFOpt: an open-source library for black-box optimization with costly function evaluations. - Alberto Costa; Giacomo Nannicini (Math. Program. Comput., 2018)

Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization. - Alberto Costa; Emanuele Di Buccio; Massimo Melucci; Giacomo Nannicini (IEEE Trans. Knowl. Data Eng., 2018)

Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States. - Nir Halman; Giacomo Nannicini (SIAM J. Optim., 2019)

Quantum Legendre-Fenchel Transform. - David Sutter; Giacomo Nannicini; Tobias Sutter; Stefan Woerner (CoRR, 2020)

An exact algorithm for robust influence maximization. - Giacomo Nannicini; Giorgio Sartor; Emiliano Traversi; Roberto Wolfler Calvo (Math. Program., 2020)

Special issue forward: the 2018 Mixed Integer Programming workshop. - Daniel Bienstock; Giacomo Nannicini (Math. Program. Comput., 2020)

Improving Variational Quantum Optimization using CVaR. - Panagiotis Kl. Barkoutsos; Giacomo Nannicini; Anton Robert; Ivano Tavernelli; Stefan Woerner (Quantum, 2020)

An Introduction to Quantum Computing, without the Physics. - Giacomo Nannicini (SIAM Rev., 2020)

A Benders squared (B2) framework for infinite-horizon stochastic linear programs. - Giacomo Nannicini; Emiliano Traversi; Roberto Wolfler Calvo (Math. Program. Comput., 2021)

On the implementation of a global optimization method for mixed-variable problems. - Giacomo Nannicini (Open J. Math. Optim., 2021)

Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. - Nir Halman; Giacomo Nannicini (Math. Program., 2022)

Nonlinear chance-constrained problems with applications to hydro scheduling. - Andrea Lodi 001; Enrico Malaguti; Giacomo Nannicini; Dimitri Thomopulos (Math. Program., 2022)

Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. - Srinivasan Arunachalam; Vojtech Havlícek; Giacomo Nannicini; Kristan Temme; Pawel Wocjan (Quantum, 2022)

Quantum tomography using state-preparation unitaries. - Joran van Apeldoorn; Arjan Cornelissen; András Gilyén; Giacomo Nannicini (SODA, 2023)

A quantum central path algorithm for linear optimization. - Brandon Augustino; Jiaqi Leng; Giacomo Nannicini; Tamás Terlaky; Xiaodi Wu 001 (CoRR, 2023)

Special Issue of INFORMS Journal on Computing - Quantum Computing and Operations Research. - Carleton Coffrin; Elisabeth Lobe; Giacomo Nannicini; Ojas Parekh (INFORMS J. Comput., 2023)

Special Issue: International Symposium on Mathematical Programming 2022. - Damek Shea Davis; Oktay Günlük; Volker Kaibel; Giacomo Nannicini; Xa-Xiang Yuan (Math. Program., 2023)

Quantum Interior Point Methods for Semidefinite Optimization. - Brandon Augustino; Giacomo Nannicini; Tamás Terlaky; Luis F. Zuluaga (Quantum, 2023)

A simple lower bound for the complexity of estimating partition functions on a quantum computer. - Zherui Chen; Giacomo Nannicini (CoRR, 2024)

Quantum algorithms for optimizers. - Giacomo Nannicini (CoRR, 2024)

Fast Quantum Subroutines for the Simplex Method. - Giacomo Nannicini (Oper. Res., 2024)

A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. - Andrea Lodi 001; Enrico Malaguti; Michele Monaci; Giacomo Nannicini; Paolo Paronuzzi (Math. Program., 2024)

A trust-region framework for derivative-free mixed-integer optimization. - Juan José Torres Figueroa; Giacomo Nannicini; Emiliano Traversi; Roberto Wolfler Calvo (Math. Program. Comput., 2024)

Introduction to the Special Issue on Quantum Computing and Operations Research. - Carleton Coffrin; Elisabeth Lobe; Giacomo Nannicini; Ojas Parekh (INFORMS J. Comput., 2025)