| Issue |
RAIRO-Oper. Res.
Volume 57, Number 4, July-August 2023
Graphs, Combinatorics, Algorithms and Optimization
|
|
|---|---|---|
| Page(s) | 1821 - 1841 | |
| DOI | https://doi.org/10.1051/ro/2023062 | |
| Published online | 14 July 2023 | |
A parallel lagrangian heuristic for the fractional chromatic number of a graph
1
Federal University of Ceará, Quixadá, Brazil
2
Digital Humanities Program, Federal Rural University of Rio de Janeiro, Nova, Iguaçu, Brazil
3
Federal University of Ceará, Fortaleza, Brazil
* Corresponding author: phmacedoaraujo@ufc.br
Received:
3
March
2023
Accepted:
28
April
2023
We propose a new integer programming formulation for the Fractional Chromatic Number Problem. The formulation is based on representatives of stable sets. In addition, we present a Lagrangian heuristic from a Lagrangian relaxation of this formulation to obtain a good feasible solution for the problem. Computational experiments are presented to evaluate and compare the upper and lower bounds provided by our approach.
Mathematics Subject Classification: 05C15 / 05C75 / 90C11 / 90C27
Key words: Fractional chromatic number / Integer programming / Lagrangian heuristic
© The authors. Published by EDP Sciences, ROADEF, SMAI 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.