The following pages link to Giacomo Nannicini (Q384804):
Displayed 35 items.
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- Item:Q384804 (redirect page) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- MILP models for the selection of a small set of well-distributed points (Q1727947) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
- Optimizing allocation in a warehouse network (Q1742223) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Fast quantum subroutines for the simplex method (Q2061891) (← links)
- A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs (Q2063190) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- On the implementation of a global optimization method for mixed-variable problems (Q2165595) (← links)
- Fast paths in large-scale dynamic road networks (Q2268926) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- Bidirectional A* search on time-dependent road networks (Q2892160) (← links)
- (Q2928710) (← links)
- A Probing Algorithm for MINLP with Failure Prediction by SVM (Q3003284) (← links)
- Bidirectional A ∗ Search for Time-Dependent Fast Paths (Q3506419) (← links)
- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks (Q3597882) (← links)
- Shortest paths on dynamic graphs (Q3638853) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- An Introduction to Quantum Computing, without the Physics (Q5140614) (← links)
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661) (← links)
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (Q5891186) (← links)
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (Q5892239) (← links)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- An exact algorithm for robust influence maximization (Q5919390) (← links)
- Special issue: International symposium on mathematical programming 2022 (Q6102758) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- A local branching heuristic for MINLPs (Q6211944) (← links)