2 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.OC2024
An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem
Xiangjing Lai, Zhenheng Lin, Jin-Kao Hao +1
Continuous p-dispersion problems with and without boundary constraints are NP-hard optimization problems with numerous real-world applications, notably in facility location and cir…