1 |
Maniezzo V, Colorni A. Dorigo M, 'The ant system applied to the quadratic assignment problem,' Technical Report 94/28, IRIDIA, Universite Libre de Bruxelles, Belgium, 1994
|
2 |
Colomi A, Dorigo M, Maniezzo V 'Distributed optimization by ant colonies' Proceeding of the first European conference on Artificial Life, Paris. MIT Press Bradford Books, Cambridge, pp.134-142, 1991
|
3 |
Dorigo M, Maniezzo V, Colorni A, 'The ant system: optimization by a colony of cooperation agents,' IEEE Transactions of Systems, Man and Cybernetics-Part B, Vol.26, No.2, pp.29-41, 1996
DOI
|
4 |
Colorni A. Dorigo M. Maniezzo V, 'An investigation of some properties of an ant algorithm,' Proceeding of the Second Conference on Parall Problem Solving from Nature, Brussels, North-Holland, Amsterdam, pp.509-520, 1992
|
5 |
Welsh D. J. A. and M. B. Powell, 'An Upper Bound for Chromatic Number of a Graph and its Application to Timetabling Problems,' Comput. J., Vol.10, pp.85-86, 1967
DOI
|
6 |
Matula, D. W, G. Marble and J. D. Issacson 'Graph Coloring Algorithms,' on Graph Theory and Computing, R. C. Read, Academic Press, New York, pp.104-122, 1972
|
7 |
Leighton F, 'A graph coloring algorithm for large scheduling problems,' J. National Bureau of Standards, Vol.84, pp.489-505, 1979
DOI
|
8 |
Colorni A. Dorigo M, 'Ant System for job shop scheduling,' Belgian J Opns Res, Stat and Comp Sci, Vol.34, pp.39-53, 1994
|
9 |
Ferland J, A, Hertz A and Lavoie A, 'An object orientedmethodology for solving assignment type problem with neighborhood search techniques,' Opns Res , Vol.44, pp.347-359, 1996
DOI
ScienceOn
|
10 |
D. Costa and Hertz A, 'Ant can colour graphs,' J. Op. Res. Society, pp.295-305, 1997
DOI
|
11 |
Bralaz D, 'New methods to color vertices of a graph,' Communications of the ACM, Vol.22, pp.251-256, 1979
DOI
ScienceOn
|
12 |
Johnson D. S., Aragon C. A, 'Optimization by Simulated Annealing : An Experimental Evaluation-Part2(Graph Coloring and Number partitioning),' Operations Research, Vol.31, pp.378-406, 1991
|