default search action
Giacomo Nannicini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Giacomo Nannicini
:
Fast Quantum Subroutines for the Simplex Method. Oper. Res. 72(2): 763-780 (2024) - [j36]Andrea Lodi
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Math. Program. 205(1): 269-301 (2024) - [j35]Juan José Torres Figueroa, Giacomo Nannicini, Emiliano Traversi, Roberto Wolfler Calvo:
A trust-region framework for derivative-free mixed-integer optimization. Math. Program. Comput. 16(3): 369-422 (2024) - [i12]Zherui Chen, Giacomo Nannicini:
A simple lower bound for the complexity of estimating partition functions on a quantum computer. CoRR abs/2404.02414 (2024) - [i11]Giacomo Nannicini:
Quantum algorithms for optimizers. CoRR abs/2408.07086 (2024) - 2023
- [j34]Carleton Coffrin, Elisabeth Lobe, Giacomo Nannicini, Ojas Parekh:
Special Issue of INFORMS Journal on Computing - Quantum Computing and Operations Research. INFORMS J. Comput. 35(3): 521-522 (2023) - [j33]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): 629-631 (2023) - [j32]Brandon Augustino
Quantum Interior Point Methods for Semidefinite Optimization. Quantum 7: 1110 (2023) - [c14]Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. SODA 2023: 1265-1318 - [i10]Brandon Augustino, Jiaqi Leng, Giacomo Nannicini, Tamás Terlaky, Xiaodi Wu:
A quantum central path algorithm for linear optimization. CoRR abs/2311.03977 (2023) - 2022
- [j31]Andrea Lodi
Nonlinear chance-constrained problems with applications to hydro scheduling. Math. Program. 191(1): 405-444 (2022) - [j30]Nir Halman
Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. Math. Program. 195(1): 183-242 (2022) - [j29]Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum 6: 789 (2022) - [i9]Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. CoRR abs/2207.08800 (2022) - 2021
- [j28]Giacomo Nannicini, Emiliano Traversi
A Benders squared (B2) framework for infinite-horizon stochastic linear programs. Math. Program. Comput. 13(4): 645-681 (2021) - [j27]Giacomo Nannicini:
On the implementation of a global optimization method for mixed-variable problems. Open J. Math. Optim. 2: 1-25 (2021) - [c13]Giacomo Nannicini:
Fast Quantum Subroutines for the Simplex Method. IPCO 2021: 311-325 - [c12]Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions. QCE 2021: 112-122 - 2020
- [j26]Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi
An exact algorithm for robust influence maximization. Math. Program. 183(1): 419-453 (2020) - [j25]Daniel Bienstock, Giacomo Nannicini:
Special issue forward: the 2018 Mixed Integer Programming workshop. Math. Program. Comput. 12(2): 131 (2020) - [j24]Panagiotis Kl. Barkoutsos
Improving Variational Quantum Optimization using CVaR. Quantum 4: 256 (2020) - [j23]Giacomo Nannicini
An Introduction to Quantum Computing, without the Physics. SIAM Rev. 62(4): 936-981 (2020) - [i8]David Sutter, Giacomo Nannicini, Tobias Sutter
Quantum Legendre-Fenchel Transform. CoRR abs/2006.04823 (2020) - [i7]Giacomo Nannicini:
On the implementation of a global optimization method for mixed-variable problems. CoRR abs/2009.02183 (2020)
2010 – 2019
- 2019
- [j22]Nir Halman
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States. SIAM J. Optim. 29(2): 1131-1163 (2019) - [c11]Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo:
An Exact Algorithm for Robust Influence Maximization. IPCO 2019: 313-326 - [i6]Giacomo Nannicini:
Fast quantum subroutines for the simplex method. CoRR abs/1910.10649 (2019) - 2018
- [j21]Nir Halman, Giacomo Nannicini, James B. Orlin:
On the complexity of energy storage problems. Discret. Optim. 28: 31-53 (2018) - [j20]Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos
Optimizing allocation in a warehouse network. Electron. Notes Discret. Math. 64: 195-204 (2018) - [j19]Alberto Costa
RBFOpt: an open-source library for black-box optimization with costly function evaluations. Math. Program. Comput. 10(4): 597-629 (2018) - [j18]Alberto Costa
Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization. IEEE Trans. Knowl. Data Eng. 30(7): 1240-1253 (2018) - [c10]Alberto Costa
Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization (Extended Abstract). ICDE 2018: 1817-1818 - [i5]Giacomo Nannicini:
Performance of hybrid quantum/classical variational heuristics for combinatorial optimization. CoRR abs/1805.12037 (2018) - [i4]Nir Halman, Giacomo Nannicini:
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states. CoRR abs/1811.11680 (2018) - 2017
- [j17]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): 9:1-9:11 (2017) - [j16]Claudia D'Ambrosio
MILP models for the selection of a small set of well-distributed points. Oper. Res. Lett. 45(1): 46-52 (2017) - [j15]Giacomo Nannicini:
Straggler Mitigation by Delayed Relaunch of Tasks. SIGMETRICS Perform. Evaluation Rev. 45(3): 248 (2017) - [i3]Gonzalo I. Diaz, Achille Fokoue, Giacomo Nannicini, Horst Samulowitz:
An effective algorithm for hyperparameter optimization of neural networks. CoRR abs/1705.08520 (2017) - [i2]Giacomo Nannicini:
An Introduction to Quantum Computing, Without the Physics. CoRR abs/1708.03684 (2017) - 2015
- [j14]Thomas Wortmann
Advantages of surrogate models for architectural design optimization. Artif. Intell. Eng. Des. Anal. Manuf. 29(4): 471-481 (2015) - [j13]Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. SIAM J. Optim. 25(1): 317-350 (2015) - 2014
- [c9]Alberto Costa, Giacomo Nannicini, Thomas Schroepfer, Thomas Wortmann:
Black-Box Optimization of Lighting Simulation in Architectural Design. CSDM Asia 2014: 27-39 - 2013
- [j12]Egon Balas, Gérard Cornuéjols, Tamás Kis
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25(3): 475-487 (2013) - [j11]Gérard Cornuéjols, François Margot, Giacomo Nannicini:
On the safety of Gomory cut generators. Math. Program. Comput. 5(4): 345-395 (2013) - [c8]Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. ESA 2013: 577-588 - 2012
- [j10]Gérard Cornuéjols, Carla Michini
How tight is the corner relaxation? Insights gained from the stable set problem. Discret. Optim. 9(2): 109-121 (2012) - [j9]Daniel Delling, Giacomo Nannicini:
Core Routing on Dynamic Time-Dependent Road Networks. INFORMS J. Comput. 24(2): 187-201 (2012) - [j8]Giacomo Nannicini, Pietro Belotti
Rounding-based heuristics for nonconvex MINLPs. Math. Program. Comput. 4(1): 1-31 (2012) - [j7]Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti
Bidirectional A* search on time-dependent road networks. Networks 59(2): 240-251 (2012) - 2011
- [j6]Gérard Cornuéjols, Leo Liberti
Improved strategies for branching on general disjunctions. Math. Program. 130(2): 225-247 (2011) - [j5]Gérard Cornuéjols, Giacomo Nannicini:
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Math. Program. Comput. 3(4): 281-318 (2011) - [j4]Leo Liberti
A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3(4): 349-390 (2011) - [c7]Giacomo Nannicini, Pietro Belotti
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR 2011: 154-169 - [p2]Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti:
Branching on Split Disjunctions. Combinatorial Optimization - Methods and Applications 2011: 164-182 - 2010
- [j3]Giacomo Nannicini:
Point-to-point shortest paths on dynamic time-dependent road networks. 4OR 8(3): 327-330 (2010) - [j2]Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1): 143-158 (2010) - [p1]Leo Liberti, Giacomo Nannicini, Nenad Mladenovic:
A Good Recipe for Solving MINLPs. Matheuristics 2010: 231-244
2000 – 2009
- 2009
- [b1]Giacomo Nannicini:
Point-to-point shortest paths on dynamic time-dependent road networks. École Polytechnique, Palaiseau, France, 2009 - [c6]Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini:
Improved Strategies for Branching on General Disjunctions. CTW 2009: 144-145 - [e1]Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti:
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009. 2009 [contents] - 2008
- [j1]Giacomo Nannicini, Leo Liberti
Shortest paths on dynamic graphs. Int. Trans. Oper. Res. 15(5): 551-563 (2008) - [c5]Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234 - [c4]Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135 - [c3]Daniel Delling, Giacomo Nannicini:
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. ISAAC 2008: 812-823 - [c2]Giacomo Nannicini, Daniel Delling, Leo Liberti
Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346 - 2007
- [c1]Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW 2007: 115-118 - [i1]Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti:
Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-02 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: