default search action
Emiliano Traversi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Juan José Torres Figueroa, Giacomo Nannicini, Emiliano Traversi, Roberto Wolfler Calvo:
A trust-region framework for derivative-free mixed-integer optimization. Math. Program. Comput. 16(3): 369-422 (2024) - 2023
- [j24]Liding Xu
, Claudia D'Ambrosio
Branch and price for submodular bin packing. EURO J. Comput. Optim. 11: 100074 (2023) - [c12]Lorenzo Bellone, Boris Galkin, Emiliano Traversi, Enrico Natalizio:
Deep Reinforcement Learning for Combined Coverage and Resource Allocation in UAV-Aided RAN-Slicing. DCOSS-IoT 2023: 669-675 - [c11]Louis Zigrand
Optimization-driven Demand Prediction Framework for Suburban Dynamic Demand-Responsive Transport Systems. IJCAI 2023: 6335-6342 - 2022
- [j23]Debashisha Mishra, Angelo Trotta, Emiliano Traversi, Marco Di Felice, Enrico Natalizio:
Cooperative Cellular UAV-to-Everything (C-U2X) communication based on 5G sidelink for UAV swarms. Comput. Commun. 192: 173-184 (2022) - [j22]Enrico Bettiol
Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems. Comput. Oper. Res. 142: 105735 (2022) - [j21]Alberto Ceselli
Dantzig-Wolfe reformulations for binary quadratic problems. Math. Program. Comput. 14(1): 85-120 (2022) - [j20]Roberto Baldacci
Robustness of solutions to the capacitated facility location problem with uncertain demand. Optim. Lett. 16(9): 2711-2727 (2022) - [j19]Christoph Buchheim
Convex optimization under combinatorial sparsity constraints. Oper. Res. Lett. 50(6): 632-638 (2022) - [c10]Charly Alizadeh, Pegah Alizadeh, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi:
How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF. IJCNN 2022: 1-8 - [c9]Emiliano Traversi, Igor V. Zhilin
Multi-Agent Routing Optimization for Underwater Monitoring. PAAMS 2022: 397-409 - [i3]Lorenzo Bellone, Boris Galkin, Emiliano Traversi, Enrico Natalizio:
Deep Reinforcement Learning for Combined Coverage and Resource Allocation in UAV-aided RAN-slicing. CoRR abs/2211.09713 (2022) - 2021
- [j18]Pegah Alizadeh
Deterministic policies based on maximum regrets in MDPs with imprecise rewards. AI Commun. 34(4): 229-244 (2021) - [j17]Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi
Preface: CTW 2018. Discret. Appl. Math. 296: 1 (2021) - [j16]Giacomo Nannicini, Emiliano Traversi
A Benders squared (B2) framework for infinite-horizon stochastic linear programs. Math. Program. Comput. 13(4): 645-681 (2021) - [j15]Antonio Frangioni, Stefania Pan, Emiliano Traversi
A constraints-aware Reweighted Feasibility Pump approach. Oper. Res. Lett. 49(5): 671-675 (2021) - [c8]Louis Zigrand
Machine Learning Guided Optimization for Demand Responsive Transport Systems. ECML/PKDD (4) 2021: 420-436 - [i2]Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi:
A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems. CoRR abs/2103.13648 (2021) - 2020
- [j14]Fabio Furini
Preface: decomposition methods for hard optimization problems. Ann. Oper. Res. 284(2): 483-485 (2020) - [j13]Enrico Bettiol, Lucas Létocart, Francesco Rinaldi
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs. Comput. Optim. Appl. 75(2): 321-360 (2020) - [j12]Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi
An exact algorithm for robust influence maximization. Math. Program. 183(1): 419-453 (2020) - [j11]Roberto Baldacci
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. Transp. Sci. 54(2): 434-452 (2020)
2010 – 2019
- 2019
- [j10]Fabio Furini
Theoretical and computational study of several linearisation techniques for binary quadratic problems. Ann. Oper. Res. 279(1-2): 387-411 (2019) - [j9]Fabio Furini
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [c7]Pegah Alizadeh, Aomar Osmani, Emiliano Traversi:
Calcul d'une politique déterministe dans un MDP avec récompenses imprécises. EGC 2019: 45-56 - [c6]Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo:
An Exact Algorithm for Robust Influence Maximization. IPCO 2019: 313-326 - [i1]Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Jean Maeght, Emiliano Traversi:
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems. CoRR abs/1912.09232 (2019) - 2018
- [j8]Fabio Furini
Exact approaches for the knapsack problem with setups. Comput. Oper. Res. 90: 208-220 (2018) - [j7]J. David, Roland Grappe, Mathieu Lacroix, Emiliano Traversi
Self-sufficient sets in smartgrids. Electron. Notes Discret. Math. 69: 301-308 (2018) - [j6]Christoph Buchheim
Quadratic Combinatorial Optimization Using Separable Underestimators. INFORMS J. Comput. 30(3): 424-437 (2018) - [j5]Claudia D'Ambrosio, Fabio Furini
On the Product Knapsack Problem. Optim. Lett. 12(4): 691-712 (2018) - 2016
- [j4]Alberto Caprara, Fabio Furini
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. Inf. Process. Lett. 116(5): 379-386 (2016) - [c5]Joerg Schweizer, Tiziano Parriani, Emiliano Traversi, Federico Rupi:
Optimum Vehicle Flows in a Fully Automated Vehicle Network. VEHITS 2016: 195-202 - 2015
- [j3]Christoph Buchheim
On the separation of split inequalities for non-convex quadratic integer programming. Discret. Optim. 15: 1-14 (2015) - [j2]Martin Bergner, Alberto Caprara, Alberto Ceselli
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1-2): 391-424 (2015) - 2013
- [c4]Christoph Buchheim
Separable Non-convex Underestimators for Binary Quadratic Programming. SEA 2013: 236-247 - [c3]Fabio Furini
Hybrid SDP Bounding Procedure. SEA 2013: 248-259 - 2011
- [j1]Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz
Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3(3): 261-280 (2011) - [c2]Martin Bergner, Alberto Caprara, Fabio Furini
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51
2000 – 2009
- 2008
- [c1]Alberto Caprara, Emiliano Traversi, Joerg Schweizer:
An Application of Network Design with Orientation Constraints. CTW 2008: 16-21
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: