Emiliano Traversi
Emiliano Traversi
Unknown affiliation
Verified email at lipn.univ-paris13.fr
Cited by
Cited by
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), 391-424, 2015
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 (2), 237-265, 2019
Partial convexification of general MIPs by Dantzig-Wolfe reformulation
M Bergner, A Caprara, F Furini, ME Lübbecke, E Malaguti, E Traversi
International Conference on Integer Programming and Combinatorial …, 2011
Quadratic combinatorial optimization using separable underestimators
C Buchheim, E Traversi
INFORMS Journal on Computing 30 (3), 424-437, 2018
Exact approaches for the knapsack problem with setups
F Furini, M Monaci, E Traversi
Computers & Operations Research 90, 208-220, 2018
Optimal linear arrangements using betweenness variables
A Caprara, M Oswald, G Reinelt, R Schwarz, E Traversi
Mathematical Programming Computation 3 (3), 261, 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
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 (1), 387-411, 2019
Separable non-convex underestimators for binary quadratic programming
C Buchheim, E Traversi
International Symposium on Experimental Algorithms, 236-247, 2013
On the product knapsack problem
C D’ambrosio, F Furini, M Monaci, E Traversi
Optimization Letters 12 (4), 691-712, 2018
Hybrid SDP bounding procedure
F Furini, E Traversi
International Symposium on Experimental Algorithms, 248-259, 2013
An exact algorithm for robust influence maximization
G Nannicini, G Sartor, E Traversi, R Wolfler Calvo
Mathematical Programming 183, 419-453, 2020
On the separation of split inequalities for non-convex quadratic integer programming
C Buchheim, E Traversi
Discrete Optimization 15, 1-14, 2015
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
A Benders squared ( B 2 ) framework for infinite-horizon stochastic linear programs
G Nannicini, E Traversi, RW Calvo
Mathematical Programming Computation, 1-37, 2020
Extended linear formulation for binary quadratic problems
F Furini, E Traversi
Optimization Online, 2013
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
Towards a PRT capacity manual
J Schweizer, A Danesi, L Mantecchini, E Traversi, A Caprara
PRT@ LHR Conference Proceedings, 21-23, 2010
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