Fabio Furini

Orcid: 0000-0002-1839-5827

Affiliations:
  • Sapienza University of Rome, Italy
  • Université Paris Dauphine, France (former)


According to our database1, Fabio Furini authored at least 57 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Numerically Exact Algorithm for the Bin-Packing Problem.
INFORMS J. Comput., 2024

2023
CliSAT: A new exact algorithm for hard maximum clique problems.
Eur. J. Oper. Res., June, 2023

A combinatorial flow-based formulation for temporal bin packing problems.
Eur. J. Oper. Res., June, 2023

A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem.
Proceedings of the 9th International Conference on Control, 2023

2022
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups.
Optim. Lett., 2022

On the exact separation of cover inequalities of maximum-depth.
Optim. Lett., 2022

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems.
Math. Program., 2022

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem.
Oper. Res., 2022

A new branch-and-filter exact algorithm for binary constraint satisfaction problems.
Eur. J. Oper. Res., 2022

2021
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.
INFORMS J. Comput., 2021

A branch-and-cut algorithm for the Edge Interdiction Clique Problem.
Eur. J. Oper. Res., 2021

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts.
Eur. J. Oper. Res., 2021

Preface: CTW 2018.
Discret. Appl. Math., 2021

A branch-and-price algorithm for the Minimum Sum Coloring Problem.
Discret. Appl. Math., 2021

2020
On integer and bilevel formulations for the <i>k</i>-vertex cut problem.
Math. Program. Comput., 2020

A branch-and-price algorithm for the temporal bin packing problem.
Comput. Oper. Res., 2020

Preface: decomposition methods for hard optimization problems.
Ann. Oper. Res., 2020

2019
A note on selective line-graphs and partition colorings.
Oper. Res. Lett., 2019

A lexicographic pricer for the fractional bin packing problem.
Oper. Res. Lett., 2019

QPLIB: a library of quadratic programming instances.
Math. Program. Comput., 2019

A new branch-and-bound algorithm for the maximum edge-weighted clique problem.
Eur. J. Oper. Res., 2019

The maximum clique interdiction problem.
Eur. J. Oper. Res., 2019

Benders decomposition for very large scale partial set covering and maximal covering location problems.
Eur. J. Oper. Res., 2019

The vertex k-cut problem.
Discret. Optim., 2019

A new branch-and-bound algorithm for the Maximum Weighted Clique Problem.
Comput. Oper. Res., 2019

Theoretical and computational study of several linearisation techniques for binary quadratic problems.
Ann. Oper. Res., 2019

2018
On the Product Knapsack Problem.
Optim. Lett., 2018

ILP Models and Column Generation for the Minimum Sum Coloring Problem.
Electron. Notes Discret. Math., 2018

Exact approaches for the knapsack problem with setups.
Comput. Oper. Res., 2018

An exact algorithm for the Partition Coloring Problem.
Comput. Oper. Res., 2018

2017
Improving the Approximated Projected Perspective Reformulation by dual information.
Oper. Res. Lett., 2017

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem.
Networks, 2017

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res., 2017

Solving vertex coloring problems as maximum weight stable set problems.
Discret. Appl. Math., 2017

2016
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation.
Inf. Process. Lett., 2016

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming.
INFORMS J. Comput., 2016

Lower Bounding Techniques for DSATUR-based Branch and Bound.
Electron. Notes Discret. Math., 2016

Approximated perspective relaxations: a project and lift approach.
Comput. Optim. Appl., 2016

MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Improved rolling horizon approaches to the aircraft sequencing problem.
J. Sched., 2015

Automatic Dantzig-Wolfe reformulation of mixed integer programs.
Math. Program., 2015

Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem.
INFORMS J. Comput., 2015

ILP and CP Formulations for the Lazy Bureaucrat Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics.
IEEE Trans. Signal Process., 2014

State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Mathematical formulations for the Balanced Vertex k-Separator Problem.
Proceedings of the International Conference on Control, 2014

2013
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem.
INFORMS J. Comput., 2013

A fast heuristic approach for train timetabling in a railway node.
Electron. Notes Discret. Math., 2013

Models for the two-dimensional two-stage cutting stock problem with multiple stock size.
Comput. Oper. Res., 2013

Hybrid SDP Bounding Procedure.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.
Eur. J. Oper. Res., 2012

Exact weighted vertex coloring via branch-and-price.
Discret. Optim., 2012

Decomposition and reformulation of integer linear programming problems.
4OR, 2012

Aircraft Sequencing Problems via a Rolling Horizon Algorithm.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Decomposition and reformulation of integer linear programming problems.
PhD thesis, 2011

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011


  Loading...