most citedA Branch-and-Price Algorithm for the Temporal Bin Packing Problem

5 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2026

An Exact Algorithm for the Max-Min Covering Location Blocker Problem

Yun-Tian Zhang, Chen Chen, Fabio Furini +1

We introduce the Max-Min Covering Location Blocker Problem, a bilevel optimization problem in which a leader blocks a minimum-cost set of candidate locations so that the optimal co…

math.OC2026

An Integer Programming Approach to Compute Lower Bounds for Ramsey Numbers Using Circulant Graphs

Stefano Coniglio, Fabio Furini, Ivana Ljubić +3

The Ramsey number is the smallest order at which every red-blue edge coloring of a complete graph must contain a blue clique (a complete subgraph) of size or a red cli…

math.OC2026

Parametric maximum closure on precedence forests

Valerio Dose, Fabio Furini, Marco Locatelli

The Maximum Closure Problem asks for a maximum-weight closed subset of a precedence-constrained set of vertices; when vertex weights depend affinely on a scalar parameter , as i…

math.OC2026

Hardness of some optimization problems over correlation polyhedra

Alberto Caprara, Fabio Furini, Claudio Gentile +2

We prove the \textbf{NP}-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the rank-on…

math.OC2019★ 5 cited

A Branch-and-Price Algorithm for the Temporal Bin Packing Problem

Mauro Dell'Amico, Fabio Furini, Manuel Iori

We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks f…