Emiliano Traversi
Emiliano Traversi
Verified email at
Cited by
Cited by
QPLIB: a library of quadratic programming instances
F Furini, E Traversi, P Belotti, A Frangioni, A Gleixner, N Gould, L Liberti, ...
Mathematical Programming Computation 11, 237-265, 2019
Automatic Dantzig–Wolfe reformulation of mixed integer programs
M Bergner, A Caprara, A Ceselli, F Furini, ME Lübbecke, E Malaguti, ...
Mathematical Programming 149 (1-2), 391-424, 2015
Exact approaches for the knapsack problem with setups
F Furini, M Monaci, E Traversi
Computers & Operations Research 90, 208-220, 2018
Quadratic combinatorial optimization using separable underestimators
C Buchheim, E Traversi
INFORMS Journal on Computing 30 (3), 424-437, 2018
Partial convexification of general MIPs by Dantzig-Wolfe reformulation
M Bergner, A Caprara, F Furini, ME Lübbecke, E Malaguti, E Traversi
Integer Programming and Combinatoral Optimization: 15th International …, 2011
Comparison of static vehicle flow assignment methods and microsimulations for a personal rapid transit network
J Schweizer, A Danesi, F Rupi, E Traversi
Journal of advanced transportation 46 (4), 340-350, 2012
Optimal linear arrangements using betweenness variables
A Caprara, M Oswald, G Reinelt, R Schwarz, E Traversi
Mathematical Programming Computation 3, 261-280, 2011
Solving the temporal knapsack problem via recursive Dantzig–Wolfe reformulation
A Caprara, F Furini, E Malaguti, E Traversi
Information Processing Letters 116 (5), 379-386, 2016
Theoretical and computational study of several linearisation techniques for binary quadratic problems
F Furini, E Traversi
Annals of Operations Research 279, 387-411, 2019
On the product knapsack problem
C D’ambrosio, F Furini, M Monaci, E Traversi
Optimization Letters 12, 691-712, 2018
An exact algorithm for robust influence maximization
G Nannicini, G Sartor, E Traversi, R Wolfler Calvo
Mathematical Programming 183 (1-2), 419-453, 2020
Separable non-convex underestimators for binary quadratic programming
C Buchheim, E Traversi
International Symposium on Experimental Algorithms, 236-247, 2013
Hybrid SDP bounding procedure
F Furini, E Traversi
Experimental Algorithms: 12th International Symposium, SEA 2013, Rome, Italy …, 2013
Cooperative Cellular UAV-to-Everything (C-U2X) communication based on 5G sidelink for UAV swarms
D Mishra, A Trotta, E Traversi, M Di Felice, E Natalizio
Computer Communications 192, 173-184, 2022
A clique merging algorithm to solve semidefinite relaxations of optimal power flow problems
J Sliwak, ED Andersen, MF Anjos, L Létocart, E Traversi
IEEE Transactions on Power Systems 36 (2), 1641-1644, 2020
Optimal solution of vehicle routing problems with fractional objective function
R Baldacci, A Lim, E Traversi, R Wolfler Calvo
Transportation Science 54 (2), 434-452, 2020
On the separation of split inequalities for non-convex quadratic integer programming
C Buchheim, E Traversi
Discrete Optimization 15, 1-14, 2015
A Benders squared () framework for infinite-horizon stochastic linear programs
G Nannicini, E Traversi, RW Calvo
Mathematical Programming Computation 13 (4), 645-681, 2021
Improving clique decompositions of semidefinite relaxations for optimal power flow problems
J Sliwak, M Anjos, L Létocart, J Maeght, E Traversi
arXiv preprint arXiv:1912.09232, 2019
A julia module for polynomial optimization with complex variables applied to optimal power flow
J Sliwak, M Ruiz, MF Anjos, L Létocart, E Traversi
2019 IEEE Milan PowerTech, 1-6, 2019
The system can't perform the operation now. Try again later.
Articles 1–20