4 papers
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…
A Tight 2-Approximation Algorithm for the Bin Packing Problem with Setups
Roberto Baldacci, Fabio Ciccarelli, Stefano Coniglio +2
We study approximation algorithms for the Bin Packing Problem with Setups (BPPS), a generalization of the classical Bin Packing Problem (BPP) in which items are partitioned into cl…
The Bin Packing Problem with Setups: Formulations, Structural Properties and Computational Insights
Roberto Baldacci, Fabio Ciccarelli, Stefano Coniglio +2
We introduce the Bin Packing Problem with Setups (BPPS), a generalization of the classical Bin Packing Problem with applications in production planning and logistics. In this probl…
Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
Fabio Ciccarelli, Valerio Dose, Fabio Furini +1
We theoretically and computationally compare the strength of the three main upper bounds from the literature on the optimal value of the Edge-Weighted Maximum Clique Problem (EWMCP…