E-LIB Suche - Ergebnisse für: Traversi, Emiliano

1

A scalable combinatorial benders decomposition for the Stoc..:

Zigrand, Louis ; Wolfler Calvo, Roberto ; Traversi, Emiliano.
Transportation Research Part C: Emerging Technologies. 163 (2024) - p. 104624 , 2024

Link: https://doi.org/10.1016/..

2

Branch and price for submodular bin packing:

Xu, Liding ; D'Ambrosio, Claudia ; Haddad-Vanier, Sonia.
EURO Journal on Computational Optimization. 11 (2023) - p. 100074 , 2023

Link: https://doi.org/10.1016/..

3

Deep Reinforcement Learning for Combined Coverage and Resou..:

, In: 2023 19th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT),

Bellone, Lorenzo ; Galkin, Boris ; Traversi, Emiliano. - p. 669-675 , 2023

Link: https://doi.org/10.1109/..

4

Robustness of solutions to the capacitated facility locatio..:

Baldacci, Roberto ; Caserta, Marco ; Traversi, Emiliano.
Optimization Letters. 16 (2022) 9 - p. 2711-2727 , 2022

Link: https://doi.org/10.1007/..

5

Convex optimization under combinatorial sparsity constraint:

Buchheim, Christoph ; Traversi, Emiliano
Operations Research Letters. 50 (2022) 6 - p. 632-638 , 2022

Link: https://doi.org/10.1016/..

6

Mining for diamonds—Matrix generation algorithms for binary..:

Bettiol, Enrico ; Bomze, Immanuel ; Létocart, Lucas..
Computers & Operations Research. 142 (2022) - p. 105735 , 2022

Link: https://doi.org/10.1016/..

7

Advanced Modeling Techniques for Mission Planning of Marine..:

, In: OCEANS 2022, Hampton Roads,

Luvisutto, Alberto ; Miolato, Mattia ; AlMaleki, Omar... - p. 1-6 , 2022

Link: https://doi.org/10.1109/..

8

How to Learn the Optimal Clique Decompositions in Solving S..:

, In: 2022 International Joint Conference on Neural Networks (IJCNN),

Alizadeh, Charly ; Alizadeh, Pegah ; Anjos, Miguel F... - p. 1-8 , 2022

Link: https://doi.org/10.1109/..

9

Cooperative Cellular UAV-to-Everything (C-U2X) communicatio..:

Mishra, Debashisha ; Trotta, Angelo ; Traversi, Emiliano..
Computer Communications. , 2022

Link: https://doi.org/10.1016/..

10

Dantzig–Wolfe reformulations for binary quadratic problems:

Ceselli, Alberto ; Létocart, Lucas ; Traversi, Emiliano
Mathematical Programming Computation. 14 (2022) 1 - p. 85-120 , 2022

Link: https://doi.org/10.1007/..

11

Preface: CTW 2018:

Furini, Fabio ; Lambert, Amélie ; Létocart, Lucas..
Discrete Applied Mathematics. 296 (2021) - p. 1 , 2021

Link: https://doi.org/10.1016/..

12

A constraints-aware Reweighted Feasibility Pump approach:

Frangioni, Antonio ; Pan, Stefania ; Traversi, Emiliano.
Operations Research Letters. 49 (2021) 5 - p. 671-675 , 2021

Link: https://doi.org/10.1016/..

13

An exact algorithm for robust influence maximization:

Nannicini, Giacomo ; Sartor, Giorgio ; Traversi, Emiliano.
Mathematical Programming. 183 (2020) 1-2 - p. 419-453 , 2020

Link: https://doi.org/10.1007/..

14

A Benders squared ($$B^2$$) framework for infinite-horizon ..:

Nannicini, Giacomo ; Traversi, Emiliano ; Calvo, Roberto Wolfler
Mathematical Programming Computation. 13 (2020) 4 - p. 645-681 , 2020

Link: https://doi.org/10.1007/..

15

A conjugate direction based simplicial decomposition framew..:

Bettiol, Enrico ; Létocart, Lucas ; Rinaldi, Francesco.
Computational Optimization and Applications. 75 (2019) 2 - p. 321-360 , 2019

Link: https://doi.org/10.1007/..