Fabio Furini

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 39

Top Venues

University of Bologna, Italy (PHD)

Education History

University of Bologna, Italy

PHD

Publications

Roberto Baldacci, Stefano Coniglio, Jean-François Cordeau, Fabio Furini
A Numerically Exact Algorithm for the Bin-Packing Problem. INFORMS J. Comput. 36 (1) (2024)
John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini
A combinatorial flow-based formulation for temporal bin packing problems. Eur. J. Oper. Res. 307 (2) (2023)
Isma Bentoumi, Fabio Furini, Ali Ridha Mahjoub, Sébastien Martin
A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. CoDIT (2023)
Pablo San Segundo, Fabio Furini, David Álvarez, Panos M. Pardalos
CliSAT: A new exact algorithm for hard maximum clique problems. Eur. J. Oper. Res. 307 (3) (2023)
Pablo San Segundo, Fabio Furini, Rafael León
A new branch-and-filter exact algorithm for binary constraint satisfaction problems. Eur. J. Oper. Res. 299 (2) (2022)
Stefano Coniglio, Fabio Furini, Ivana Ljubic
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Program. 196 (1) (2022)
John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim. Lett. 16 (8) (2022)
Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Oper. Res. 70 (4) (2022)
Daniele Catanzaro, Stefano Coniglio, Fabio Furini
On the exact separation of cover inequalities of maximum-depth. Optim. Lett. 16 (2) (2022)
Stefano Coniglio, Fabio Furini, Pablo San Segundo
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. Eur. J. Oper. Res. 289 (2) (2021)
Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. Eur. J. Oper. Res. 294 (1) (2021)
Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi
Preface: CTW 2018. Discret. Appl. Math. 296 (2021)
Diego Delle Donne, Fabio Furini, Enrico Malaguti, Roberto Wolfler Calvo
A branch-and-price algorithm for the Minimum Sum Coloring Problem. Discret. Appl. Math. 303 (2021)
Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput. 33 (3) (2021)
Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi
-vertex cut problem. Math. Program. Comput. 12 (2) (2020)
Fabio Furini, Ivana Ljubic, Emiliano Traversi
Preface: decomposition methods for hard optimization problems. Ann. Oper. Res. 284 (2) (2020)
Mauro Dell'Amico, Fabio Furini, Manuel Iori
A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114 (2020)
Stefano Coniglio, Fabio D'Andreagiovanni, Fabio Furini
A lexicographic pricer for the fractional bin packing problem. Oper. Res. Lett. 47 (6) (2019)
Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11 (2) (2019)
Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278 (1) (2019)
Fabio Furini, Emiliano Traversi
Theoretical and computational study of several linearisation techniques for binary quadratic problems. Ann. Oper. Res. 279 (1-2) (2019)
Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo
The maximum clique interdiction problem. Eur. J. Oper. Res. 277 (1) (2019)
Pablo San Segundo, Fabio Furini, Jorge Artieda
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. Comput. Oper. Res. 110 (2019)
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
The vertex k-cut problem. Discret. Optim. 31 (2019)
Jean-François Cordeau, Fabio Furini, Ivana Ljubic
Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275 (3) (2019)
Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini
A note on selective line-graphs and partition colorings. Oper. Res. Lett. 47 (6) (2019)
Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi
On the Product Knapsack Problem. Optim. Lett. 12 (4) (2018)
Fabio Furini, Michele Monaci, Emiliano Traversi
Exact approaches for the knapsack problem with setups. Comput. Oper. Res. 90 (2018)
Fabio Furini, Enrico Malaguti, Alberto Santini
An exact algorithm for the Partition Coloring Problem. Comput. Oper. Res. 92 (2018)
Fabio Furini, Enrico Malaguti, Sébastien Martin, Ian-Christopher Ternier
ILP Models and Column Generation for the Minimum Sum Coloring Problem. Electron. Notes Discret. Math. 64 (2018)
Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. Networks 69 (1) (2017)
Denis Cornaz, Fabio Furini, Enrico Malaguti
Solving vertex coloring problems as maximum weight stable set problems. Discret. Appl. Math. 217 (2017)
Fabio Furini, Ivana Ljubic, Markus Sinnl
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262 (2) (2017)
Antonio Frangioni, Fabio Furini, Claudio Gentile
Improving the Approximated Projected Perspective Reformulation by dual information. Oper. Res. Lett. 45 (5) (2017)
Antonio Frangioni, Fabio Furini, Claudio Gentile
Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63 (3) (2016)
Filippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard, Xueying Shen
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. ISCO (2016)
Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier
Lower Bounding Techniques for DSATUR-based Branch and Bound. Electron. Notes Discret. Math. 52 (2016)
Alberto Caprara, Fabio Furini, Enrico Malaguti, Emiliano Traversi
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. Inf. Process. Lett. 116 (5) (2016)
Fabio Furini, Enrico Malaguti, Dimitri Thomopulos
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. INFORMS J. Comput. 28 (4) (2016)
Fabio Furini, Ivana Ljubic, Markus Sinnl
ILP and CP Formulations for the Lazy Bureaucrat Problem. CPAIOR (2015)
Martin Bergner, Alberto Caprara, Alberto Ceselli, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149 (1-2) (2015)
Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. INFORMS J. Comput. 27 (2) (2015)
Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth
Improved rolling horizon approaches to the aircraft sequencing problem. J. Sched. 18 (5) (2015)
Denis Cornaz, Fabio Furini, Enrico Malaguti
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW (2015)
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT (2014)
Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. ISCO (2014)
Alberto Caprara, Fabio Furini, Andrea Lodi, Mauro Mangia, Riccardo Rovatti, Gianluca Setti
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. IEEE Trans. Signal Process. 62 (6) (2014)
Fabio Furini, Martin Philip Kidd
A fast heuristic approach for train timetabling in a railway node. Electron. Notes Discret. Math. 41 (2013)
Alberto Caprara, Fabio Furini, Enrico Malaguti
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. INFORMS J. Comput. 25 (3) (2013)
Fabio Furini, Emiliano Traversi
Hybrid SDP Bounding Procedure. SEA (2013)
Fabio Furini, Enrico Malaguti
Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Comput. Oper. Res. 40 (8) (2013)
Fabio Furini, Carlo Alfredo Persiani, Paolo Toth
Aircraft Sequencing Problems via a Rolling Horizon Algorithm. ISCO (2012)
Fabio Furini, Enrico Malaguti, Rosa Medina Durán, Alfredo Persiani, Paolo Toth
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur. J. Oper. Res. 218 (1) (2012)
Fabio Furini, Enrico Malaguti
Exact weighted vertex coloring via branch-and-price. Discret. Optim. 9 (2) (2012)
Fabio Furini
Decomposition and reformulation of integer linear programming problems. 4OR 10 (2) (2012)
Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO (2011)

Fabio Furini.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Fabio Furini