Giacomo Nannicini

Math. Program., 2022

2021

On the implementation of a global optimization method for mixed-variable problems.

[BibT_eX]

[DOI]

Open J. Math. Optim., 2021

A Benders squared (B2) framework for infinite-horizon stochastic linear programs.

[BibT_eX]

[DOI]

Emiliano Traversi

Roberto Wolfler Calvo

Math. Program. Comput., 2021

Fast Quantum Subroutines for the Simplex Method.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

An Introduction to Quantum Computing, without the Physics.

[BibT_eX]

[DOI]

Panagiotis Kl. Barkoutsos

SIAM Rev., 2020

Improving Variational Quantum Optimization using CVaR.

[BibT_eX]

[DOI]

Quantum, 2020

Special issue forward: the 2018 Mixed Integer Programming workshop.

[BibT_eX]

[DOI]

Daniel Bienstock

Math. Program. Comput., 2020

An exact algorithm for robust influence maximization.

[BibT_eX]

[DOI]

Giorgio Sartor

Emiliano Traversi

Roberto Wolfler Calvo

Math. Program., 2020

Quantum Legendre-Fenchel Transform.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

2018

Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

RBFOpt: an open-source library for black-box optimization with costly function evaluations.

[BibT_eX]

[DOI]

Alberto Costa

Math. Program. Comput., 2018

Optimizing allocation in a warehouse network.

[BibT_eX]

[DOI]

Enrico Malaguti

Dimitri Thomopulos

Electron. Notes Discret. Math., 2018

On the complexity of energy storage problems.

[BibT_eX]

[DOI]

James B. Orlin

Discret. Optim., 2018

Performance of hybrid quantum/classical variational heuristics for combinatorial optimization.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

Straggler Mitigation by Delayed Relaunch of Tasks.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2017

MILP models for the selection of a small set of well-distributed points.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Giorgio Sartor

Oper. Res. Lett., 2017

An effective algorithm for hyperparameter optimization of neural networks.

[BibT_eX]

[DOI]

Gonzalo I. Diaz

Achille Fokoue-Nkoutche

Horst Samulowitz

IBM J. Res. Dev., 2017

2015

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs.

[BibT_eX]

[DOI]

James B. Orlin

SIAM J. Optim., 2015

Advantages of surrogate models for architectural design optimization.

[BibT_eX]

[DOI]

Artif. Intell. Eng. Des. Anal. Manuf., 2015

2014

Black-Box Optimization of Lighting Simulation in Architectural Design.

[BibT_eX]

[DOI]

Proceedings of the Complex Systems Design & Management Asia, Designing Smart Cities: Proceedings of the First Asia, 2014

2013

On the safety of Gomory cut generators.

[BibT_eX]

[DOI]

François Margot

Math. Program. Comput., 2013

Combining Lift-and-Project and Reduce-and-Split.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2013

2012

Bidirectional A* search on time-dependent road networks.

[BibT_eX]

[DOI]

Networks, 2012

Rounding-based heuristics for nonconvex MINLPs.

[BibT_eX]

[DOI]

Pietro Belotti

Math. Program. Comput., 2012

Core Routing on Dynamic Time-Dependent Road Networks.

[BibT_eX]

[DOI]

Daniel Delling

INFORMS J. Comput., 2012

How tight is the corner relaxation? Insights gained from the stable set problem.

[BibT_eX]

[DOI]

Carla Michini

Discret. Optim., 2012

2011

Branching on Split Disjunctions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

A recipe for finding good solutions to MINLPs.

[BibT_eX]

[DOI]

Nenad Mladenovic

Math. Program. Comput., 2011

Practical strategies for generating rank-1 split cuts in mixed-integer linear programming.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

Improved strategies for branching on general disjunctions.

[BibT_eX]

[DOI]

Math. Program., 2011

A Probing Algorithm for MINLP with Failure Prediction by SVM.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010

A Good Recipe for Solving MINLPs.

[BibT_eX]

[DOI]

Nenad Mladenovic

Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

Fast paths in large-scale dynamic road networks.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2010

Point-to-point shortest paths on dynamic time-dependent road networks.

[BibT_eX]

[DOI]

4OR, 2010

2009

Point-to-point shortest paths on dynamic time-dependent road networks.

[BibT_eX]

[DOI]

PhD thesis, 2009

2008

Shortest paths on dynamic graphs.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2008

Bidirectional A* Search for Time-Dependent Fast Paths.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks.

[BibT_eX]

[DOI]

Daniel Delling