A fast local search algorithm for minimum sum coloring problem on massive graphs

Published: 01 Jan 2024, Last Modified: 06 Feb 2025Comput. Oper. Res. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•New reduction method for Minimum Sum Coloring Problem.•New scoring functions and their corresponding selection rules for guiding the search process.•Novel local search framework for massive graphs.
Loading