Giacomo Nannicini

From MaRDI portal
Person:384804

Available identifiers

zbMath Open nannicini.giacomoMaRDI QIDQ384804

List of research outcomes





PublicationDate of PublicationType
A trust-region framework for derivative-free mixed-integer optimization2024-11-29Paper
Fast quantum subroutines for the simplex method2024-07-25Paper
Quantum tomography using state-preparation unitaries2024-05-14Paper
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions2024-04-09Paper
Special issue: International symposium on mathematical programming 20222023-06-23Paper
Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs2022-10-24Paper
On the implementation of a global optimization method for mixed-variable problems2022-08-20Paper
Nonlinear chance-constrained problems with applications to hydro scheduling2022-03-22Paper
A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs2022-01-10Paper
Fast quantum subroutines for the simplex method2021-12-21Paper
An Introduction to Quantum Computing, without the Physics2020-12-16Paper
An exact algorithm for robust influence maximization2020-08-28Paper
An exact algorithm for robust influence maximization2020-02-06Paper
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States2019-05-07Paper
RBFOpt: an open-source library for black-box optimization with costly function evaluations2019-05-03Paper
MILP models for the selection of a small set of well-distributed points2019-02-21Paper
On the complexity of energy storage problems2018-08-17Paper
Optimizing allocation in a warehouse network2018-04-11Paper
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs2017-01-13Paper
Core routing on dynamic time-dependent road networks2016-06-29Paper
Branching on split disjunctions2014-11-10Paper
On the safety of Gomory cut generators2014-10-06Paper
A recipe for finding good solutions to MINLPs2013-11-28Paper
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming2013-11-28Paper
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs2013-09-17Paper
Rounding-based heuristics for nonconvex MINLPS2012-11-27Paper
How tight is the corner relaxation? Insights gained from the stable set problem2012-09-11Paper
Bidirectional \(A^*\) search on time-dependent road networks2012-06-18Paper
Improved strategies for branching on general disjunctions2011-12-14Paper
A Probing Algorithm for MINLP with Failure Prediction by SVM2011-05-26Paper
Point-to-point shortest paths on dynamic time-dependent road networks2010-12-06Paper
Fast paths in large-scale dynamic road networks2010-03-15Paper
Shortest paths on dynamic graphs2009-10-28Paper
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks2009-01-29Paper
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks2009-01-27Paper
A local branching heuristic for MINLPs2008-12-11Paper
Bidirectional A  ∗  Search for Time-Dependent Fast Paths2008-06-13Paper

Research outcomes over time

This page was built for person: Giacomo Nannicini