图的分数色数的平行拉格朗日启发式

RAIRO Oper. Res. Pub Date : 2023-05-03 DOI:10.1051/ro/2023062

P. Araújo, Ricardo C. Corrêa, Manoel B. Campêlo

{"title":"图的分数色数的平行拉格朗日启发式","authors":"P. Araújo, Ricardo C. Corrêa, Manoel B. Campêlo","doi":"10.1051/ro/2023062","DOIUrl":null,"url":null,"abstract":"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.\nComputational experiments are presented to evaluate and compare the upper and lower bounds provided by our approach.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A parallel lagrangian heuristic for the fractional chromatic number of a graph\",\"authors\":\"P. Araújo, Ricardo C. Corrêa, Manoel B. Campêlo\",\"doi\":\"10.1051/ro/2023062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\\nComputational experiments are presented to evaluate and compare the upper and lower bounds provided by our approach.\",\"PeriodicalId\":20872,\"journal\":{\"name\":\"RAIRO Oper. Res.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023062\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2023062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

针对分数阶色数问题，提出了一个新的整数规划公式。该公式基于稳定集的代表。此外，我们还利用该公式的拉格朗日松弛给出了一个拉格朗日启发式，从而得到了该问题的一个很好的可行解。给出了计算实验来评估和比较我们的方法提供的上界和下界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A parallel lagrangian heuristic for the fractional chromatic number of a graph

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

RAIRO Oper. Res.

自引率

0.00%

发文量