4 papers · 1 filter
Advancing Branch-and-Price for Graph Coloring: New Pricing Strategies and Benchmark Results
Mingming Zheng, Roberto Baldacci, Fabio Furini +1
This paper proposes BPCOL+, an exact branch-and-price algorithm for the Graph Coloring Problem. The algorithm integrates enhanced pricing strategies based on Zero-Suppressed Binary…
Branch-and-price strikes back for the k-vertex cut problem
Fabio Ciccarelli, Fabio Furini, Christopher Hojny +1
Given an undirected graph, the k-vertex cut problem (k-VCP) asks for a minimum-cost set of vertices whose removal yields at least k connected components in the resulting graph. The…
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…
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…