Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Avanthay, C., Hertz, A., Zufferey, N.: Variable Neighborhood Search for Graph Coloring. European Journal of Operational Research 151, 379–388 (2003)
2. Baravykaitė, M., Čiegis, R., Žilinskas, J.: Template realization of the generalized branch and bound algorithm. Mathematical Modelling and Analysis 10(3), 217–236 (2005)
3. Brélaz, D.: New Methods to Color the Vertices of a Graph. Communications of the ACM 22, 251–256 (1979)
4. Chiarandini, M., Dumitrescu, I., Stülze, T.: Local Search for the Colouring Problem. A Computational Study. Technical Report AIDA-03-01, Darmstadt University of Technology (2003)
5. Crainic, T.G., Toulouse, M., Gendreau, M.: Towards a Taxonomy of Parallel Tabu Search Heuristics. INFORMS Journal of Computing 9, 61–72 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献