no. 1
Méthodes heuristiques pour le problème du T-coloriage avec ensembles
RAIRO - Operations Research - Recherche Opérationnelle, Volume 32 (1998) no. 1, pp. 75-99 
@article{RO_1998__32_1_75_0,
     author = {Jiang, Marc},
     title = {M\'ethodes heuristiques pour le probl\`eme du $T$-coloriage avec ensembles},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {75--99},
     publisher = {EDP Sciences},
     volume = {32},
     number = {1},
     year = {1998},
     mrnumber = {1619197},
     language = {fr},
     url = {https://www.numdam.org/item/RO_1998__32_1_75_0/}
}
TY  - JOUR
AU  - Jiang, Marc
TI  - Méthodes heuristiques pour le problème du $T$-coloriage avec ensembles
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1998
SP  - 75
EP  - 99
VL  - 32
IS  - 1
PB  - EDP Sciences
UR  - https://www.numdam.org/item/RO_1998__32_1_75_0/
LA  - fr
ID  - RO_1998__32_1_75_0
ER  - 
%0 Journal Article
%A Jiang, Marc
%T Méthodes heuristiques pour le problème du $T$-coloriage avec ensembles
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1998
%P 75-99
%V 32
%N 1
%I EDP Sciences
%U https://www.numdam.org/item/RO_1998__32_1_75_0/
%G fr
%F RO_1998__32_1_75_0
Jiang, Marc. Méthodes heuristiques pour le problème du $T$-coloriage avec ensembles. RAIRO - Operations Research - Recherche Opérationnelle, Volume 32 (1998) no. 1, pp. 75-99. https://www.numdam.org/item/RO_1998__32_1_75_0/

1. F. Box, A Heuristic Technique for Assigning Frequencies to Mobile Radio Nets, IEEE Transaction on vehicular technology, mai 1978, vol. VT-27, n° 2, p. 57-64.

2. W. K. Hale, Frequency Assignment: Theory and Application, Proceedings of the IEEE, December 1980, 68, n° 12, p. 1498-1573.

3. A. Gamst, Some Lower Bounds for a Class of Frequency Assignment Problems, IEEE Transaction on vehicular technology, février 1986, vol VT-35, n° 1, p. 8-14.

4. A. Hertz et D. De Werra, Using Tabu Search Techniques for Graph Coloring, Computing, 1987, 39, p. 345-351. | Zbl | MR

5. A. Gamst, A Resource Allocation Technique for FDMA Systems, Alfa Frequenza, 1988, vol. LVII-N.2, p. 89-96.

6. C. Friden, A. Hertz et D. De Werra, STABULUS: A Technique of Finding Stable Sets in large Graphs with Tabu Search, 1989, Computing, 42, p. 35-44. | Zbl

7. F. Glover, Tabu search, part I, ORSA Journal on Computing, 1989, 1, n° 3, p. 190-206. | Zbl

8. M. Kubale, Interval vertex-coloring of a graph with forbidden colors, Discrete Mathematic, 1989, 74, p. 125-136. | Zbl | MR

9. F. Glover, Tabu search, part II, ORSA Journal on Computing, 1990, 2, n° 1, p. 4-31. | Zbl

10. E. Taillard, Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing, 1991, 17, p. 443-455. | MR

11. M. Kubale, Some results concerning the complexity of restricted colorings of graphs, Discrete Applied Mathematics, 1992, 36, p. 35-46. | Zbl | MR

12. D. Costa, On the use of some known methods for T-colorings of graphs, Annals, of Operations Research, 1993, 41, p. 343-358. | Zbl

13. D. Klimowicz et M. Kubale, Graph coloring by Tabu search and simulated annealing, Archives of Control Sciences, 1993, 2 (XXXVIII), n° 1-2, p. 41-54. | Zbl | MR

14. D. De Werra et Y. Gay, Chromatic scheduling and Frequency assignment, Discrete Applied Mathematics, 1994, 49, p. 165-174. | Zbl | MR