arrow
返回

An exact algorithm for the edge coloring by total labeling problem

delete2018-07-25
delete4
PRE
AI
F
Fabrizio Borghini
I
Isabel Méndez‐Díaz
P
Paula Zabala *
DOI:10.1007/s10479-018-2977-xdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Annals of Operations Research 封面图
Annals of Operations Research
IF:
4.5
论文数:
8.1K
被引数:
2.1W

机构

U
University of Buenos Aires
学者数:
2.2W
论文数: 1.3W
被引数: 14
引用论文

引用论文

err分享
err收藏
Hiperuricemia asintomática y enfermedad arterial coronaria无症状高尿酸血症和冠状动脉疾病
err2021-05-01
err0
PREAI
errTomás Miranda-Aquino; Silvia Esmeralda Pérez-Topete; Christian González-Padilla; Jorge Eduardo Hernández-del Río; Óscar Sergio Lomelí-Sánchez; Ramón Miguel Esturau-Santaló; Sergio Ramón Gutiérrez-Ureña; Verónica González-Díaz
err分享
err收藏
学者 查看更多内容