返回
An exact algorithm for the edge coloring by total labeling problem
DOI:10.1007/s10479-018-2977-x.png)
摘要
En 中文
This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels of its two endpoints, determine a proper edge coloring of the graph. We propose two integer programming formulations and derive valid inequalities which are added as cutting planes on a Branch-and-Cut framework. In order to improve the efficiency of the algorithm, we also develop initial and primal heuristics. The algorithm is tested on random instances and the computational results show that it is very effective in comparison with CPLEX. It is displayed that it reduces both the CPU time (for solved instances) and the final percentage gap (for unsolved instances), and that it is capable of solving instances that are out of the reach of CPLEX.
Keyword:
Total labeling
Edge coloring
Graph coloring
Branch-and-Cut
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Geri Dönüştürülmüş Beton Agregasının Kendiliğinden Yerleşen Betonun Performansına Etkisi再生混凝土骨料对自密实混凝土性能的影响
Performance evaluation of steel-concrete composite structures designed in poorly graded soils在不良级配土中设计的钢-混凝土组合结构的性能评估
Intervention of super brain yoga towards brainwave balancing index, brainwave dominance and short term memory超级大脑瑜伽干预对脑波平衡指数、脑波主导性和短期记忆的影响

