Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. - Martin Bergner; Alberto Caprara; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (IPCO, 2011)

Decomposition and reformulation of integer linear programming problems. - Fabio Furini (2011)

Aircraft Sequencing Problems via a Rolling Horizon Algorithm. - Fabio Furini; Carlo Alfredo Persiani; Paolo Toth (ISCO, 2012)

Decomposition and reformulation of integer linear programming problems. - Fabio Furini (4OR, 2012)

Exact weighted vertex coloring via branch-and-price. - Fabio Furini; Enrico Malaguti (Discret. Optim., 2012)

A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. - Fabio Furini; Enrico Malaguti; Rosa Medina Durán; Alfredo Persiani; Paolo Toth (Eur. J. Oper. Res., 2012)

Hybrid SDP Bounding Procedure. - Fabio Furini; Emiliano Traversi (SEA, 2013)

Models for the two-dimensional two-stage cutting stock problem with multiple stock size. - Fabio Furini; Enrico Malaguti (Comput. Oper. Res., 2013)

A fast heuristic approach for train timetabling in a railway node. - Fabio Furini; Martin Philip Kidd (Electron. Notes Discret. Math., 2013)

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. - Alberto Caprara; Fabio Furini; Enrico Malaguti (INFORMS J. Comput., 2013)

Mathematical formulations for the Balanced Vertex k-Separator Problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2014)

State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. - Fabio Furini; Martin Philip Kidd; Carlo Alfredo Persiani; Paolo Toth (ISCO, 2014)

Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. - Alberto Caprara; Fabio Furini; Andrea Lodi 001; Mauro Mangia; Riccardo Rovatti; Gianluca Setti (IEEE Trans. Signal Process., 2014)

Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. - Denis Cornaz; Fabio Furini; Enrico Malaguti (CTW, 2015)

ILP and CP Formulations for the Lazy Bureaucrat Problem. - Fabio Furini; Ivana Ljubic; Markus Sinnl (CPAIOR, 2015)

Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. - Fabio Furini; Manuel Iori; Silvano Martello; Mutsunori Yagiura (INFORMS J. Comput., 2015)

Automatic Dantzig-Wolfe reformulation of mixed integer programs. - Martin Bergner; Alberto Caprara; Alberto Ceselli; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (Math. Program., 2015)

Improved rolling horizon approaches to the aircraft sequencing problem. - Fabio Furini; Martin Philip Kidd; Carlo Alfredo Persiani; Paolo Toth (J. Sched., 2015)

MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. - Filippo Focacci; Fabio Furini; Virginie Gabrel; Daniel Godard; Xueying Shen (ISCO, 2016)

Approximated perspective relaxations: a project and lift approach. - Antonio Frangioni; Fabio Furini; Claudio Gentile (Comput. Optim. Appl., 2016)

Lower Bounding Techniques for DSATUR-based Branch and Bound. - Fabio Furini; Virginie Gabrel; Ian-Christopher Ternier (Electron. Notes Discret. Math., 2016)

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. - Fabio Furini; Enrico Malaguti; Dimitri Thomopulos (INFORMS J. Comput., 2016)

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. - Alberto Caprara; Fabio Furini; Enrico Malaguti; Emiliano Traversi (Inf. Process. Lett., 2016)

Solving vertex coloring problems as maximum weight stable set problems. - Denis Cornaz; Fabio Furini; Enrico Malaguti (Discret. Appl. Math., 2017)

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. - Fabio Furini; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2017)

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. - Fabio Furini; Virginie Gabrel; Ian-Christopher Ternier (Networks, 2017)

Improving the Approximated Projected Perspective Reformulation by dual information. - Antonio Frangioni; Fabio Furini; Claudio Gentile (Oper. Res. Lett., 2017)

An exact algorithm for the Partition Coloring Problem. - Fabio Furini; Enrico Malaguti; Alberto Santini (Comput. Oper. Res., 2018)

Exact approaches for the knapsack problem with setups. - Fabio Furini; Michele Monaci; Emiliano Traversi (Comput. Oper. Res., 2018)

ILP Models and Column Generation for the Minimum Sum Coloring Problem. - Fabio Furini; Enrico Malaguti; Sébastien Martin; Ian-Christopher Ternier (Electron. Notes Discret. Math., 2018)

On the Product Knapsack Problem. - Claudia D'Ambrosio; Fabio Furini; Michele Monaci; Emiliano Traversi (Optim. Lett., 2018)

Theoretical and computational study of several linearisation techniques for binary quadratic problems. - Fabio Furini; Emiliano Traversi (Ann. Oper. Res., 2019)

A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. - Pablo San Segundo; Fabio Furini; Jorge Artieda (Comput. Oper. Res., 2019)

The vertex k-cut problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (Discret. Optim., 2019)

Benders decomposition for very large scale partial set covering and maximal covering location problems. - Jean-François Cordeau; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

The maximum clique interdiction problem. - Fabio Furini; Ivana Ljubic; Sébastien Martin; Pablo San Segundo (Eur. J. Oper. Res., 2019)

A new branch-and-bound algorithm for the maximum edge-weighted clique problem. - Pablo San Segundo; Stefano Coniglio; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

QPLIB: a library of quadratic programming instances. - Fabio Furini; Emiliano Traversi; Pietro Belotti; Antonio Frangioni; Ambros M. Gleixner; Nick Gould; Leo Liberti; Andrea Lodi 001; Ruth Misener; Hans D. Mittelmann; Nikolaos V. Sahinidis; Stefan Vigerske; et al. (Math. Program. Comput., 2019)

A lexicographic pricer for the fractional bin packing problem. - Stefano Coniglio; Fabio D'Andreagiovanni; Fabio Furini (Oper. Res. Lett., 2019)

A note on selective line-graphs and partition colorings. - Denis Cornaz; Fabio Furini; Enrico Malaguti; Alberto Santini (Oper. Res. Lett., 2019)

Preface: decomposition methods for hard optimization problems. - Fabio Furini; Ivana Ljubic; Emiliano Traversi (Ann. Oper. Res., 2020)

A branch-and-price algorithm for the temporal bin packing problem. - Mauro Dell'Amico; Fabio Furini; Manuel Iori (Comput. Oper. Res., 2020)

On integer and bilevel formulations for the k-vertex cut problem. - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Math. Program. Comput., 2020)

A branch-and-price algorithm for the Minimum Sum Coloring Problem. - Diego Delle Donne; Fabio Furini; Enrico Malaguti; Roberto Wolfler Calvo (Discret. Appl. Math., 2021)

Preface: CTW 2018. - Fabio Furini; Amélie Lambert; Lucas Létocart; Leo Liberti; Emiliano Traversi (Discret. Appl. Math., 2021)

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. - Stefano Coniglio; Fabio Furini; Pablo San Segundo (Eur. J. Oper. Res., 2021)

A branch-and-cut algorithm for the Edge Interdiction Clique Problem. - Fabio Furini; Ivana Ljubic; Pablo San Segundo; Yanlu Zhao (Eur. J. Oper. Res., 2021)

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. - Timo Gschwind; Stefan Irnich; Fabio Furini; Roberto Wolfler Calvo (INFORMS J. Comput., 2021)

A new branch-and-filter exact algorithm for binary constraint satisfaction problems. - Pablo San Segundo; Fabio Furini; Rafael León (Eur. J. Oper. Res., 2022)

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Oper. Res., 2022)

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. - Stefano Coniglio; Fabio Furini; Ivana Ljubic (Math. Program., 2022)

On the exact separation of cover inequalities of maximum-depth. - Daniele Catanzaro; Stefano Coniglio; Fabio Furini (Optim. Lett., 2022)

Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. - John Martinovic; Nico Strasdat; José M. Valério de Carvalho; Fabio Furini (Optim. Lett., 2022)

A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. - Isma Bentoumi; Fabio Furini; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2023)

A combinatorial flow-based formulation for temporal bin packing problems. - John Martinovic; Nico Strasdat; José M. Valério de Carvalho; Fabio Furini (Eur. J. Oper. Res., 2023)

CliSAT: A new exact algorithm for hard maximum clique problems. - Pablo San Segundo; Fabio Furini; David Álvarez 001; Panos M. Pardalos (Eur. J. Oper. Res., 2023)

A Numerically Exact Algorithm for the Bin-Packing Problem. - Roberto Baldacci; Stefano Coniglio; Jean-François Cordeau; Fabio Furini (INFORMS J. Comput., 2024)

Integer linear programming formulations for the maximum flow blocker problem. - Isma Bentoumi; Fabio Furini; Ali Ridha Mahjoub; Sébastien Martin (Eur. J. Oper. Res., 2025)