Représentation de matrices euclidiennes en vue de leur génération aléatoire
RAIRO - Operations Research - Recherche Opérationnelle (1985)
- Volume: 19, Issue: 4, page 375-379
- ISSN: 0399-0559
Access Full Article
topHow to cite
topReferences
top- 1. M. BRANDENBERGER, Generalized Network Generator, Institut pour l'Automation et la Recherche Opérationnelle, CH-1700 Fribourg, 1983.
- 2. N. CHRISTOFIDES, The Travelling Salesman Problem, Report 77-11, Dept. of Management Science, Imperial College, London, 1977. Zbl0415.90057
- 3. F. MATTHÄUS, Tourenplanung-Verfahren zur Einsatzdisposition von Fuhrparks, S. Toeche-Mittler Verlag, Darmstadt, 1978.
- 4. D. J. ROSENKRANTZ, R. E. STEARNS et P. M. LEWIS, Approximate Algorithms for the T.S.P., Proc. 15th I.E.E.E. Symp. on Switching and Automata Theorey, 1974, p. 33. MR424258
- 5. M. H. J. WEBB, Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities, Operational Research Quarterly, vol. 22, n° 1, 1971, p.49-66. Zbl0216.26703