Fabio Furini

Pubblicazioni

Titolo Pubblicato in Anno
On the exact separation of cover inequalities of maximum-depth OPTIMIZATION LETTERS 2022
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem OPERATIONS RESEARCH 2022
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems MATHEMATICAL PROGRAMMING 2022
A new branch-and-filter exact algorithm for binary constraint satisfaction problems EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups OPTIMIZATION LETTERS 2022
A branch-and-price framework for decomposing graphs into relaxed cliques INFORMS JOURNAL ON COMPUTING 2021
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021
A branch-and-price algorithm for the Minimum Sum Coloring Problem DISCRETE APPLIED MATHEMATICS 2021
A branch-and-cut algorithm for the Edge Interdiction Clique Problem EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021
On integer and bilevel formulations for the k-vertex cut problem MATHEMATICAL PROGRAMMING COMPUTATION 2020
A branch-and-price algorithm for the temporal bin packing problem COMPUTERS & OPERATIONS RESEARCH 2020
Tighter MIP models for Barge Container Ship Routing OMEGA 2019
The maximum clique interdiction problem EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019
A lexicographic pricer for the fractional bin packing problem OPERATIONS RESEARCH LETTERS 2019
A new branch-and-bound algorithm for the maximum edge-weighted clique problem EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019
Theoretical and computational study of several linearisation techniques for binary quadratic problems ANNALS OF OPERATIONS RESEARCH 2019
The vertex k-cut problem DISCRETE OPTIMIZATION 2019
A note on selective line-graphs and partition colorings OPERATIONS RESEARCH LETTERS 2019
QPLIB: a library of quadratic programming instances MATHEMATICAL PROGRAMMING COMPUTATION 2019
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem COMPUTERS & OPERATIONS RESEARCH 2019

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma