| Autor: |
Mehdi Mrad, Olfa Harrabi, Jouhaina Chaouachi Siala, Anis Gharbi |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
IEEE Access, Vol 8, Pp 57891-57904 (2020) |
| Druh dokumentu: |
article |
| ISSN: |
2169-3536 |
| DOI: |
10.1109/ACCESS.2020.2973122 |
| Popis: |
The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors. A column generation approach is proposed to solve the linear relaxation of a set partition-based formulation. Various enhancements are proposed in order to efficiently obtain attractive columns while avoiding as much as possible the exact solution of the huge number of the NP-hard pricing problems. Experimental results conducted on 42 hard benchmark instances show an average reduction of 89.73% of the gap between the best known lower and upper bounds, including 14 new optimality results. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
