Giacomo Nannicini

Available identifiers

zbMath Open nannicini.giacomoMaRDI QIDQ384804

List of research outcomes

Publication	Date of Publication	Type
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions	2024-04-09	Paper
Special issue: International symposium on mathematical programming 2022	2023-06-23	Paper
Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs	2022-10-24	Paper
On the implementation of a global optimization method for mixed-variable problems	2022-08-20	Paper
Nonlinear chance-constrained problems with applications to hydro scheduling	2022-03-22	Paper
A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs	2022-01-10	Paper
Fast quantum subroutines for the simplex method	2021-12-21	Paper
An Introduction to Quantum Computing, without the Physics	2020-12-16	Paper
An exact algorithm for robust influence maximization	2020-08-28	Paper
An exact algorithm for robust influence maximization	2020-02-06	Paper
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States	2019-05-07	Paper
RBFOpt: an open-source library for black-box optimization with costly function evaluations	2019-05-03	Paper
MILP models for the selection of a small set of well-distributed points	2019-02-21	Paper
On the complexity of energy storage problems	2018-08-17	Paper
Optimizing allocation in a warehouse network	2018-04-11	Paper
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs	2017-01-13	Paper
Core Routing on Dynamic Time-Dependent Road Networks	2016-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q2928710	2014-11-10	Paper
On the safety of Gomory cut generators	2014-10-06	Paper
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming	2013-11-28	Paper
A recipe for finding good solutions to MINLPs	2013-11-28	Paper
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs	2013-09-17	Paper
Rounding-based heuristics for nonconvex MINLPS	2012-11-27	Paper
How tight is the corner relaxation? Insights gained from the stable set problem	2012-09-11	Paper
Bidirectional A* search on time-dependent road networks	2012-06-18	Paper
Improved strategies for branching on general disjunctions	2011-12-14	Paper
A Probing Algorithm for MINLP with Failure Prediction by SVM	2011-05-26	Paper
Point-to-point shortest paths on dynamic time-dependent road networks	2010-12-06	Paper
Fast paths in large-scale dynamic road networks	2010-03-15	Paper
Shortest paths on dynamic graphs	2009-10-28	Paper
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks	2009-01-29	Paper
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks	2009-01-27	Paper
A local branching heuristic for MINLPs	2008-12-11	Paper
Bidirectional A  ∗  Search for Time-Dependent Fast Paths	2008-06-13	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Giacomo Nannicini