Giacomo Nannicini

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