Emiliano Traversi

Math. Program. Comput., September, 2024

2023

Branch and price for submodular bin packing.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., January, 2023

Optimization-driven Demand Prediction Framework for Suburban Dynamic Demand-Responsive Transport Systems.

[BibT_eX]

[DOI]

Louis Zigrand

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Deep Reinforcement Learning for Combined Coverage and Resource Allocation in UAV-Aided RAN-Slicing.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing in Smart Systems and the Internet of Things, 2023

2022

Convex optimization under combinatorial sparsity constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Robustness of solutions to the capacitated facility location problem with uncertain demand.

[BibT_eX]

[DOI]

Roberto Baldacci

Marco Caserta

Optim. Lett., 2022

Dantzig-Wolfe reformulations for binary quadratic problems.

[BibT_eX]

[DOI]

Alberto Ceselli

Lucas Létocart

Math. Program. Comput., 2022

Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Cooperative Cellular UAV-to-Everything (C-U2X) communication based on 5G sidelink for UAV swarms.

[BibT_eX]

[DOI]

Comput. Commun., 2022

Multi-Agent Routing Optimization for Underwater Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Advances in Practical Applications of Agents, Multi-Agent Systems, and Complex Systems Simulation. The PAAMS Collection, 2022

How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2022

2021

A constraints-aware Reweighted Feasibility Pump approach.

[BibT_eX]

[DOI]

Antonio Frangioni

Stefania Pan

Oper. Res. Lett., 2021

A Benders squared (B<sup>2</sup>) framework for infinite-horizon stochastic linear programs.

[BibT_eX]

[DOI]

Giacomo Nannicini

Math. Program. Comput., 2021

Preface: CTW 2018.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems.

[BibT_eX]

[DOI]

CoRR, 2021

Deterministic policies based on maximum regrets in MDPs with imprecise rewards.

[BibT_eX]

[DOI]

Aomar Osmani

AI Commun., 2021

Machine Learning Guided Optimization for Demand Responsive Transport Systems.

[BibT_eX]

[DOI]

Louis Zigrand

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track, 2021

2020

Optimal Solution of Vehicle Routing Problems with Fractional Objective Function.

[BibT_eX]

[DOI]

Roberto Baldacci

Andrew Lim

Transp. Sci., 2020

An exact algorithm for robust influence maximization.

[BibT_eX]

[DOI]

Giacomo Nannicini

Giorgio Sartor

Math. Program., 2020

A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2020

Preface: decomposition methods for hard optimization problems.

[BibT_eX]

[DOI]

Ivana Ljubic

Ann. Oper. Res., 2020

2019

QPLIB: a library of quadratic programming instances.

[BibT_eX]

[DOI]

Nikolaos V. Sahinidis

Stefan Vigerske

Angelika Wiegele

Math. Program. Comput., 2019

Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems.

[BibT_eX]

[DOI]

CoRR, 2019

Theoretical and computational study of several linearisation techniques for binary quadratic problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

Calcul d'une politique déterministe dans un MDP avec récompenses imprécises.

[BibT_eX]

[DOI]

Aomar Osmani

Proceedings of the Extraction et Gestion des connaissances, 2019

2018

On the Product Knapsack Problem.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Quadratic Combinatorial Optimization Using Separable Underestimators.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2018

Self-sufficient sets in smartgrids.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Exact approaches for the knapsack problem with setups.

[BibT_eX]

[DOI]

Michele Monaci

Comput. Oper. Res., 2018

2016

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Optimum Vehicle Flows in a Fully Automated Vehicle Network.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Vehicle Technology and Intelligent Transport Systems, 2016

2015

Automatic Dantzig-Wolfe reformulation of mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 2015

On the separation of split inequalities for non-convex quadratic integer programming.

[BibT_eX]

[DOI]

Discret. Optim., 2015

2013

Hybrid SDP Bounding Procedure.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Separable Non-convex Underestimators for Binary Quadratic Programming.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2011

Optimal linear arrangements using betweenness variables.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2008

An Application of Network Design with Orientation Constraints.

[BibT_eX]

Alberto Caprara