5 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
Optimal Macroitem Sequences in the Precedence Constrained Knapsack Problem
Valerio Dose, Fabio Furini, Marco Locatelli
The Precedence Constrained Knapsack Problem (PCKP) asks for a maximum-profit subset of items, subject to a knapsack capacity constraint and precedence constraints encoded by a dire…
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…
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…