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 |
-
Transient inter-production scheduling based on Petri nets and constraint programming
Bourdeaud'huy, Thomas, (2011)
-
Barros, Rafael Martins, (2025)
-
Mixed graph colouring for unit-time scheduling
Kouider, Ahmed, (2017)
- More ...
-
Semi on-line algorithms for the partition problem
Kellerer, Hans, (1997)
-
Learning of winning strategies for terminal games with linear-size memory
Böhme, Thomas, (2009)
-
Satisfactory graph partition, variants, and generalizations
Bazgan, Cristina, (2010)
- More ...