FURINI, FABIO

FURINI, FABIO  

DIPARTIMENTO DI INGEGNERIA INFORMATICA, AUTOMATICA E GESTIONALE -ANTONIO RUBERTI-  

Mostra prodotti
Risultati 1 - 20 di 40 (tempo di esecuzione: 0.025 secondi).
Titolo Data di pubblicazione Autore(i) File
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 algorithm for the Minimum Sum Coloring Problem 2021 Delle Donne, D.; Furini, F.; Malaguti, E.; Wolfler Calvo, R.
A branch-and-price algorithm for the temporal bin packing problem 2020 Dell'Amico, M.; Furini, F.; Iori, M.
A branch-and-price framework for decomposing graphs into relaxed cliques 2021 Gschwind, T.; Irnich, S.; Furini, F.; Calvo, R. W.
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size 2012 Furini, F.; Malaguti, E.; Medina Duran, R.; Persiani, A.; Toth, P.
A fast heuristic approach for train timetabling in a railway node 2013 Furini, F.; Kidd, M. P.
A lexicographic pricer for the fractional bin packing problem 2019 Coniglio, S.; D'Andreagiovanni, F.; Furini, F.
A new branch-and-bound algorithm for the maximum edge-weighted clique problem 2019 San Segundo, P.; Coniglio, S.; Furini, F.; Ljubic, I.
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem 2019 San Segundo, P.; Furini, F.; Artieda, J.
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts 2021 Coniglio, S.; Furini, F.; San Segundo, P.
A note on selective line-graphs and partition colorings 2019 Cornaz, D.; Furini, F.; Malaguti, E.; Santini, A.
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem 2017 Furini, F.; Ljubic, I.; Sinnl, M.
An exact algorithm for the Partition Coloring Problem 2018 Furini, F.; Malaguti, E.; Santini, A.
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem 2017 Furini, F.; Gabrel, V.; Ternier, I. -C.
Approaches to a real-world Train Timetabling Problem in a railway node 2016 Cacchiani, V.; Furini, F.; Kidd, M. P.
Approximated perspective relaxations: a project and lift approach 2016 Frangioni, A.; Furini, F.; Gentile, C.
Automatic Dantzig–Wolfe reformulation of mixed integer programs 2015 Bergner, M.; Caprara, A.; Ceselli, A.; Furini, F.; Lubbecke, M. E.; Malaguti, E.; Traversi, E.
Benders decomposition for very large scale partial set covering and maximal covering location problems 2019 Cordeau, J. -F.; Furini, F.; Ljubic, I.
Exact approaches for the knapsack problem with setups 2018 Furini, F.; Monaci, M.; Traversi, E.
Exact weighted vertex coloring via branch-and-price 2012 Furini, F.; Malaguti, E.