10 citations · 13 across the 5 of their papers we have counts for
5 papers
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…
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…
A Multi-population Integrated Approach for Capacitated Location Routing
Pengfei He, Jin-Kao Hao, Qinghua Wu
The capacitated location-routing problem involves determining the depots from a set of candidate capacitated depot locations and finding the required routes from the selected depot…
Solving the Clustered Traveling Salesman Problem via TSP methods
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explo…
Improved Lower Bounds for Sum Coloring via Clique Decomposition
Qinghua Wu, Jin-Kao Hao
Given an undirected graph with a set of vertices and a set of edges, the minimum sum coloring problem (MSCP) is to find a legal vertex coloring of , using co…