Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Follow
Giacomo Nannicini
Title
Cited by
Cited by
Year
A Benders squared () framework for infinite-horizon stochastic linear programs
G Nannicini, E Traversi, RW Calvo
Mathematical Programming Computation 13 (4), 645-681, 2021
82021
A computationally efficient FPTAS for convex stochastic dynamic programs
N Halman, G Nannicini, J Orlin
SIAM Journal on Optimization 25 (1), 317-350, 2015
192015
A good recipe for solving MINLPs
L Liberti, G Nannicini, N Mladenović
Matheuristics: Hybridizing metaheuristics and mathematical programming, 231-244, 2009
432009
A local branching heuristic for MINLPs
G Nannicini, P Belotti, L Liberti
ArXiv e-prints, 2008
37*2008
A probing algorithm for MINLP with failure prediction by SVM
G Nannicini, P Belotti, J Lee, J Linderoth, F Margot, A Wächter
Integration of AI and OR Techniques in Constraint Programming for …, 2011
132011
A quantum central path algorithm for linear optimization
B Augustino, J Leng, G Nannicini, T Terlaky, X Wu
arXiv preprint arXiv:2311.03977, 2023
22023
A recipe for finding good solutions to MINLPs
L Liberti, N Mladenović, G Nannicini
Mathematical Programming Computation 3, 349-390, 2011
492011
A simple lower bound for the complexity of estimating partition functions on a quantum computer
Z Chen, G Nannicini
arXiv preprint arXiv:2404.02414, 2024
2024
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
A Lodi, E Malaguti, M Monaci, G Nannicini, P Paronuzzi
Mathematical Programming 205 (1), 269-301, 2024
2024
A trust-region framework for derivative-free mixed-integer optimization
JJ Torres, G Nannicini, E Traversi, R Wolfler Calvo
Mathematical Programming Computation, 1-54, 2024
2024
Accurately solving linear systems with quantum oracles
M Mohammadisiahroudi, R Fakhimi, B Augustino, T Terlaky, G Nannicini
APS March Meeting Abstracts 2023, B64. 012, 2023
52023
Adiabatic progression with intermediate re-optimization to solve hard variational quantum problems in quantum computing
D Greenberg, M Pistoia, R Chen, G Nannicini
US Patent 12,001,921, 2024
2024
Adiabatic progression with intermediate re-optimization to solve hard variational quantum problems in quantum computing
D Greenberg, M Pistoia, R Chen, G Nannicini
US Patent 12,008,434, 2024
2024
Adiabatic progression with intermediate re-optimization to solve hard variational quantum problems in quantum computing
D Greenberg, M Pistoia, R Chen, G Nannicini
US Patent 11,341,427, 2022
22022
Adiabatic progression with intermediate re-optimization to solve hard variational quantum problems in quantum computing
D Greenberg, M Pistoia, R Chen, G Nannicini
US Patent 11,334,810, 2022
2022
Advantages of surrogate models for architectural design optimization
T Wortmann, A Costa, G Nannicini, T Schroepfer
AI EDAM 29 (4), 471-481, 2015
1302015
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
2112017
An exact algorithm for robust influence maximization
G Nannicini, G Sartor, E Traversi, R Wolfler Calvo
Mathematical Programming 183 (1), 419-453, 2020
192020
An introduction to quantum computing, without the physics
G Nannicini
SIAM Review 62 (4), 936-981, 2020
512020
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
602017
The system can't perform the operation now. Try again later.
Articles 1–20