3 papers
math.OC2026
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…
math.OC2025
A first approximation algorithm for the Bin Packing Problem with Setups
Roberto Baldacci, Fabio Ciccarelli, Stefano Coniglio +2
We study constant-factor approximation algorithms for the Bin Packing Problem with Setups (BPPS). First, we show that adaptations of classical BPP heuristics can have arbitrarily p…
math.CO2025
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…