Cicular coloring of graphs via linear programming and tabu search
Year of publication: |
December 2015
|
---|---|
Authors: | Barany, Mate ; Tuza, Zsolt |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 23.2015, 4, p. 833-848
|
Subject: | Circular graph coloring | Cyclic scheduling | Linear programming | Tabu search | Parallel computing | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics |
-
Combined neighborhood tabu search for community detection in complex networks
Gach, Olivier, (2016)
-
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
Lu, Yongliang, (2022)
-
The maximum happy induced subgraph problem : bounds and algorithms
Lewis, Rhyd, (2021)
- More ...
-
Tuza, Zsolt, (1989)
-
Satisfactory graph partition, variants, and generalizations
Bazgan, Cristina, (2010)
-
Colorability of mixed hypergraphs and their chromatic inversions
Hegyháti, Máté, (2013)
- More ...