The Vertex Coloring Problem and its generalizations

被引：11

作者：

Malaguti, Enrico ^{[1
]}

机构：

[1] Univ Bologna, DEIS, Bologna, Italy

来源：

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2009年 / 7卷 / 01期

关键词：

Vertex Coloring; Graph; Mathematical Models; Heuristics; Ad hoc networks; Fairness;

D O I：

10.1007/s10288-008-0071-y

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This is a summary of the author's PhD thesis supervised by Paolo Toth and defended on 29 May 2007 at the UniversitA di Bologna. The thesis is written in English and is available from the author upon request. The first part of this work deals with the Vertex Coloring Problem and its generalizations, for which models, bounds and algorithms are proposed. The Second Part is dedicated to a different problem on graphs, namely a Routing Problem in telecommunication networks where not only the efficiency, but also the fairness of the solution is considered.

引用

页码：101 / 104

页数：4

共 50 条

[31] ON A PROBLEM OF ZALCMAN AND ITS GENERALIZATIONS
VOLCHKOV, VV
[J]. MATHEMATICAL NOTES, 1993, 53 (1-2) : 134 - 138
[32] A problem of Carlitz and its generalizations
Pan, Xinliang
Zhao, XiaoRui
Cao, Wei
[J]. ARCHIV DER MATHEMATIK, 2014, 102 (04) : 337 - 343
[33] New Integer Linear Programming Models for the Vertex Coloring Problem
Jabrayilov, Adalat
Mutzel, Petra
[J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 640 - 652
[34] An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
Gary A. Kochenberger
Fred Glover
Bahram Alidaee
Cesar Rego
[J]. Annals of Operations Research, 2005, 139 : 229 - 241
[35] Solving Graph Vertex Coloring Problem with Microfluidic DNA Computer
Niu, Ying
Zhang, Xuncai
Cui, Guangzhao
[J]. PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 5061 - 5065
[36] An unconstrained quadratic binary programming approach to the vertex coloring problem
Kochenberger, GA
Glover, F
Alidaee, B
Rego, C
[J]. ANNALS OF OPERATIONS RESEARCH, 2005, 139 (01) : 229 - 241
[37] New heuristics for the vertex coloring problem based on semidefinite programming
Jelena Govorčin
Nebojša Gvozdenović
Janez Povh
[J]. Central European Journal of Operations Research, 2013, 21 : 13 - 25
[38] Synthesis of Vertex Coloring Problem using Grover's Algorithm
Saha, Amit
Chongder, Avik
Mandal, Sudhindu Bikash
Chakrabarti, Amlan
[J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON NANOELECTRONIC AND INFORMATION SYSTEMS, 2015, : 101 - 106
[39] A Method for the Graph Vertex Coloring Problem Based on DNA Origami
Ma Jingjing
Xu Jin
[J]. JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2021, 43 (06) : 1750 - 1755
[40] New heuristics for the vertex coloring problem based on semidefinite programming
Govorcin, Jelena
Gvozdenovic, Nebojsa
Povh, Janez
[J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 : S13 - S25

← 1 2 3 4 5 →