Méthodes heuristiques pour le problème du T -coloriage avec ensembles

Marc Jiang

RAIRO - Operations Research - Recherche Opérationnelle (1998)

  • Volume: 32, Issue: 1, page 75-99
  • ISSN: 0399-0559

How to cite

top

Jiang, Marc. "Méthodes heuristiques pour le problème du $T$-coloriage avec ensembles." RAIRO - Operations Research - Recherche Opérationnelle 32.1 (1998): 75-99. <http://eudml.org/doc/105163>.

@article{Jiang1998,
author = {Jiang, Marc},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {fre},
number = {1},
pages = {75-99},
publisher = {EDP-Sciences},
title = {Méthodes heuristiques pour le problème du $T$-coloriage avec ensembles},
url = {http://eudml.org/doc/105163},
volume = {32},
year = {1998},
}

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
PB - EDP-Sciences
VL - 32
IS - 1
SP - 75
EP - 99
LA - fre
UR - http://eudml.org/doc/105163
ER -

References

top
  1. 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. 2. W. K. HALE, Frequency Assignment: Theory and Application, Proceedings of the IEEE, December 1980, 68, n° 12, p. 1498-1573. 
  3. 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. 4. A. HERTZ et D. de WERRA, Using Tabu Search Techniques for Graph Coloring, Computing, 1987, 39, p. 345-351. Zbl0626.68051MR923459
  5. 5. A. GAMST, A Resource Allocation Technique for FDMA Systems, Alfa Frequenza, 1988, vol. LVII-N.2, p. 89-96. 
  6. 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. Zbl0685.68056
  7. 7. F. GLOVER, Tabu search, part I, ORSA Journal on Computing, 1989, 1, n° 3, p. 190-206. Zbl0753.90054
  8. 8. M. KUBALE, Interval vertex-coloring of a graph with forbidden colors, Discrete Mathematic, 1989, 74, p. 125-136. Zbl0682.05033MR989128
  9. 9. F. GLOVER, Tabu search, part II, ORSA Journal on Computing, 1990, 2, n° 1, p. 4-31. Zbl0771.90084
  10. 10. E. TAILLARD, Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing, 1991, 17, p. 443-455. MR1123015
  11. 11. M. KUBALE, Some results concerning the complexity of restricted colorings of graphs, Discrete Applied Mathematics, 1992, 36, p. 35-46. Zbl0755.05036MR1158768
  12. 12. D. COSTA, On the use of some known methods for T-colorings of graphs, Annals, of Operations Research, 1993, 41, p. 343-358. Zbl0771.68089
  13. 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. Zbl0812.68100MR1288596
  14. 14. D. de WERRA et Y. GAY, Chromatic scheduling and Frequency assignment, Discrete Applied Mathematics, 1994, 49, p. 165-174. Zbl0801.90067MR1272486

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.