FURINI, FABIO
FURINI, FABIO
Istituto di Analisi dei Sistemi ed Informatica ''Antonio Ruberti'' - IASI
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
2021 Furini F.; Ljubic I.; San Segundo P.; Zhao Y.
A branch-and-price framework for decomposing graphs into relaxed cliques
2021 Gschwind, T; Irnich, S; Furini, F; Calvo, Rw
On the exact separation of cover inequalities of maximum-depth
2021 Catanzaro, D; Coniglio, S; Furini, F
A branch-and-price algorithm for the Minimum Sum Coloring Problem
2020 Delle Donne, D; Furini, F; Malaguti, E; Wolfler Calvo, R
A branch-and-price algorithm for the temporal bin packing problem
2020 Dell'Amico, Mauro; Furini, Fabio; Iori, Manuel
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
2020 Coniglio S.; Furini F.; San Segundo P.
On integer and bilevel formulations for the k-vertex cut problem
2020 Furini, F; Ljubic, I; Malaguti, E; Paronuzzi, P
A lexicographic pricer for the fractional bin packing problem
2019 Coniglio, Stefano; D'Andreagiovanni, Fabio; Furini, Fabio
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
2019 San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
2019 San Segundo, Pablo; Furini, Fabio; Artieda, Jorge
A note on selective line-graphs and partition colorings
2019 Cornaz, Denis; Furini, Fabio; Malaguti, Enrico; Santini, Alberto
Benders decomposition for very large scale partial set covering and maximal covering location problems
2019 Cordeau, Jeanfrancois; Furini, Fabio; Ljubic, Ivana
Preface: decomposition methods for hard optimization problems
2019 Furini, Fabio; Ljubic, Ivana; Traversi, Emiliano
The maximum clique interdiction problem
2019 Furini, Fabio; Ljubic, Ivana; Martin, Sebastien; San Segundo, Pablo
The vertex k-cut problem
2019 Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, A. Ridha; Martin, Sebastien
Theoretical and computational study of several linearisation techniques for binary quadratic problems
2019 Furini, Fabio; Traversi, Emiliano
Tighter MIP models for Barge Container Ship Routing
2019 Alfandari, Laurent; Davidovic, Tatjana; Furini, Fabio; Ljubic, Ivana; Maras, Vladislav; Martin, Sebastien
An exact algorithm for the Partition Coloring Problem
2018 Furini, Fabio; Malaguti, Enrico; Santini, Alberto
Exact approaches for the knapsack problem with setups
2018 Furini, Fabio; Monaci, Michele; Traversi, Emiliano
ILP Models and Column Generation for the Minimum Sum Coloring Problem
2018 Furini F.; Malaguti E.; Martin S.; Ternier I.C.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A branch-and-cut algorithm for the Edge Interdiction Clique Problem | 1-gen-2021 | Furini F.; Ljubic I.; San Segundo P.; Zhao Y. | |
| A branch-and-price framework for decomposing graphs into relaxed cliques | 1-gen-2021 | Gschwind, T; Irnich, S; Furini, F; Calvo, Rw | |
| On the exact separation of cover inequalities of maximum-depth | 1-gen-2021 | Catanzaro, D; Coniglio, S; Furini, F | |
| A branch-and-price algorithm for the Minimum Sum Coloring Problem | 1-gen-2020 | Delle Donne, D; Furini, F; Malaguti, E; Wolfler Calvo, R | |
| A branch-and-price algorithm for the temporal bin packing problem | 1-gen-2020 | Dell'Amico, Mauro; Furini, Fabio; Iori, Manuel | |
| A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts | 1-gen-2020 | Coniglio S.; Furini F.; San Segundo P. | |
| On integer and bilevel formulations for the k-vertex cut problem | 1-gen-2020 | Furini, F; Ljubic, I; Malaguti, E; Paronuzzi, P | |
| A lexicographic pricer for the fractional bin packing problem | 1-gen-2019 | Coniglio, Stefano; D'Andreagiovanni, Fabio; Furini, Fabio | |
| A new branch-and-bound algorithm for the maximum edge-weighted clique problem | 1-gen-2019 | San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana | |
| A new branch-and-bound algorithm for the Maximum Weighted Clique Problem | 1-gen-2019 | San Segundo, Pablo; Furini, Fabio; Artieda, Jorge | |
| A note on selective line-graphs and partition colorings | 1-gen-2019 | Cornaz, Denis; Furini, Fabio; Malaguti, Enrico; Santini, Alberto | |
| Benders decomposition for very large scale partial set covering and maximal covering location problems | 1-gen-2019 | Cordeau, Jeanfrancois; Furini, Fabio; Ljubic, Ivana | |
| Preface: decomposition methods for hard optimization problems | 1-gen-2019 | Furini, Fabio; Ljubic, Ivana; Traversi, Emiliano | |
| The maximum clique interdiction problem | 1-gen-2019 | Furini, Fabio; Ljubic, Ivana; Martin, Sebastien; San Segundo, Pablo | |
| The vertex k-cut problem | 1-gen-2019 | Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, A. Ridha; Martin, Sebastien | |
| Theoretical and computational study of several linearisation techniques for binary quadratic problems | 1-gen-2019 | Furini, Fabio; Traversi, Emiliano | |
| Tighter MIP models for Barge Container Ship Routing | 1-gen-2019 | Alfandari, Laurent; Davidovic, Tatjana; Furini, Fabio; Ljubic, Ivana; Maras, Vladislav; Martin, Sebastien | |
| An exact algorithm for the Partition Coloring Problem | 1-gen-2018 | Furini, Fabio; Malaguti, Enrico; Santini, Alberto | |
| Exact approaches for the knapsack problem with setups | 1-gen-2018 | Furini, Fabio; Monaci, Michele; Traversi, Emiliano | |
| ILP Models and Column Generation for the Minimum Sum Coloring Problem | 1-gen-2018 | Furini F.; Malaguti E.; Martin S.; Ternier I.C. |