Giacomo Nannicini

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 39

Top Venues

CoRR

Math. Program.

Quantum

Math. Program. Comput.

École Polytechnique, Palaiseau, France (PHD)

Education History

École Polytechnique, Palaiseau, France

PHD

Publications

Giacomo Nannicini
Fast Quantum Subroutines for the Simplex Method. Oper. Res. 72 (2) (2024)
Andrea Lodi, Enrico Malaguti, Michele Monaci, Giacomo Nannicini, Paolo Paronuzzi
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Math. Program. 205 (1) (2024)
Zherui Chen, Giacomo Nannicini
A simple lower bound for the complexity of estimating partition functions on a quantum computer. CoRR (2024)
Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan
Special Issue: International Symposium on Mathematical Programming 2022. Math. Program. 200 (2) (2023)
Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini
Quantum tomography using state-preparation unitaries. SODA (2023)
Brandon Augustino, Giacomo Nannicini, Tamás Terlaky, Luis F. Zuluaga
Quantum Interior Point Methods for Semidefinite Optimization. Quantum 7 (2023)
Brandon Augustino, Jiaqi Leng, Giacomo Nannicini, Tamás Terlaky, Xiaodi Wu
A quantum central path algorithm for linear optimization. CoRR (2023)
Carleton Coffrin, Elisabeth Lobe, Giacomo Nannicini, Ojas Parekh
- Quantum Computing and Operations Research. INFORMS J. Comput. 35 (3) (2023)
Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini
Quantum tomography using state-preparation unitaries. CoRR (2022)
Nir Halman, Giacomo Nannicini
Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. Math. Program. 195 (1) (2022)
Andrea Lodi, Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos
Nonlinear chance-constrained problems with applications to hydro scheduling. Math. Program. 191 (1) (2022)
Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum 6 (2022)
Giacomo Nannicini
Fast Quantum Subroutines for the Simplex Method. IPCO (2021)
Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan
Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions. QCE (2021)
Giacomo Nannicini
On the implementation of a global optimization method for mixed-variable problems. Open J. Math. Optim. 2 (2021)
Giacomo Nannicini, Emiliano Traversi, Roberto Wolfler Calvo
) framework for infinite-horizon stochastic linear programs. Math. Program. Comput. 13 (4) (2021)
Giacomo Nannicini
An Introduction to Quantum Computing, without the Physics. SIAM Rev. 62 (4) (2020)
David Sutter, Giacomo Nannicini, Tobias Sutter, Stefan Woerner
Quantum Legendre-Fenchel Transform. CoRR (2020)
Daniel Bienstock, Giacomo Nannicini
Special issue forward: the 2018 Mixed Integer Programming workshop. Math. Program. Comput. 12 (2) (2020)
Giacomo Nannicini
On the implementation of a global optimization method for mixed-variable problems. CoRR (2020)
Panagiotis Kl. Barkoutsos, Giacomo Nannicini, Anton Robert, Ivano Tavernelli, Stefan Woerner
Improving Variational Quantum Optimization using CVaR. Quantum 4 (2020)
Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo
An exact algorithm for robust influence maximization. Math. Program. 183 (1) (2020)
Nir Halman, Giacomo Nannicini
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States. SIAM J. Optim. 29 (2) (2019)
Giacomo Nannicini
Fast quantum subroutines for the simplex method. CoRR (2019)
Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo
An Exact Algorithm for Robust Influence Maximization. IPCO (2019)
Nir Halman, Giacomo Nannicini
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states. CoRR (2018)
Alberto Costa, Giacomo Nannicini
RBFOpt: an open-source library for black-box optimization with costly function evaluations. Math. Program. Comput. 10 (4) (2018)
Giacomo Nannicini
Performance of hybrid quantum/classical variational heuristics for combinatorial optimization. CoRR (2018)
Nir Halman, Giacomo Nannicini, James B. Orlin
On the complexity of energy storage problems. Discret. Optim. 28 (2018)
Alberto Costa, Emanuele Di Buccio, Massimo Melucci, Giacomo Nannicini
Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization (Extended Abstract). ICDE (2018)
Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos
Optimizing allocation in a warehouse network. Electron. Notes Discret. Math. 64 (2018)
Alberto Costa, Emanuele Di Buccio, Massimo Melucci, Giacomo Nannicini
Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization. IEEE Trans. Knowl. Data Eng. 30 (7) (2018)
Giacomo Nannicini
An Introduction to Quantum Computing, Without the Physics. CoRR (2017)
Gonzalo I. Diaz, Achille Fokoue, Giacomo Nannicini, Horst Samulowitz
An effective algorithm for hyperparameter optimization of neural networks. CoRR (2017)
Gonzalo I. Diaz, Achille Fokoue-Nkoutche, Giacomo Nannicini, Horst Samulowitz
An effective algorithm for hyperparameter optimization of neural networks. IBM J. Res. Dev. 61 (4-5) (2017)
Giacomo Nannicini
Straggler Mitigation by Delayed Relaunch of Tasks. SIGMETRICS Perform. Evaluation Rev. 45 (3) (2017)
Claudia D'Ambrosio, Giacomo Nannicini, Giorgio Sartor
MILP models for the selection of a small set of well-distributed points. Oper. Res. Lett. 45 (1) (2017)
Thomas Wortmann, Alberto Costa, Giacomo Nannicini, Thomas Schroepfer
Advantages of surrogate models for architectural design optimization. Artif. Intell. Eng. Des. Anal. Manuf. 29 (4) (2015)
Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. SIAM J. Optim. 25 (1) (2015)
Alberto Costa, Giacomo Nannicini, Thomas Schroepfer, Thomas Wortmann
Black-Box Optimization of Lighting Simulation in Architectural Design. CSDM Asia (2014)
Gérard Cornuéjols, François Margot, Giacomo Nannicini
On the safety of Gomory cut generators. Math. Program. Comput. 5 (4) (2013)
Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25 (3) (2013)
Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. ESA (2013)
Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti
* search on time-dependent road networks. Networks 59 (2) (2012)
Giacomo Nannicini, Pietro Belotti
Rounding-based heuristics for nonconvex MINLPs. Math. Program. Comput. 4 (1) (2012)
Daniel Delling, Giacomo Nannicini
Core Routing on Dynamic Time-Dependent Road Networks. INFORMS J. Comput. 24 (2) (2012)
Gérard Cornuéjols, Carla Michini, Giacomo Nannicini
How tight is the corner relaxation? Insights gained from the stable set problem. Discret. Optim. 9 (2) (2012)
Leo Liberti, Nenad Mladenovic, Giacomo Nannicini
A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3 (4) (2011)
Gérard Cornuéjols, Giacomo Nannicini
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Math. Program. Comput. 3 (4) (2011)
Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini
Improved strategies for branching on general disjunctions. Math. Program. 130 (2) (2011)
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR (2011)
Giacomo Nannicini
Point-to-point shortest paths on dynamic time-dependent road networks. 4OR 8 (3) (2010)
Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45 (1) (2010)
Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini
Improved Strategies for Branching on General Disjunctions. CTW (2009)
Daniel Delling, Giacomo Nannicini
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. ISAAC (2008)
Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA (2008)
Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes
Search for Time-Dependent Fast Paths. WEA (2008)
Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes
on Time-dependent Graphs. CTW (2008)
Giacomo Nannicini, Leo Liberti
Shortest paths on dynamic graphs. Int. Trans. Oper. Res. 15 (5) (2008)
Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW (2007)
Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
Fast paths in large-scale dynamic road networks CoRR (2007)

Giacomo Nannicini.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Giacomo Nannicini