Free Access
RAIRO-Oper. Res.
Volume 18, Number 3, 1984
Page(s) 203 - 210
Published online 06 February 2017
  • 1. G. CARPANETO and P. TOTH, Solution of the Assignment Problem, ACM Transactions on Mathematical Software, Vol, 6, No. 1, 1980, pp. 104-111. [Google Scholar]
  • 2. G. CARPANETO and P. TOTH, Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem, Management Science, Vol. 26, No. 7. 1980, pp. 736-743. [MR: 591295] [Zbl: 0445.90089] [Google Scholar]
  • 3. G. B. DANTZIG, D. R. FULKERSON and S. M. JOHNSON, Solution of a Large Scale Travelling Salesman Problem, Operations Research, Vol. 2, 1954, pp.393-410. [MR: 70932] [Zbl: 1187.90007] [Google Scholar]
  • 4. S. E. DREYFUS, An Appraisal of Some Shortest-Path Algorithms, Operations Research, Vol. 17, 1969, pp. 395-412. [Zbl: 0172.44202] [Google Scholar]
  • 5. R. S. GARFINKEL, On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Travelling Salesman Problem, Operations Research, Vol. 21, 1973, pp. 340-343. [MR: 353995] [Zbl: 0266.90041] [Google Scholar]
  • 6. M. HELD, Influences of the Travelling Salesman Problem, Paper presented at the XI. International Symposium on Mathematical Programming, Bonn, 1982. [Google Scholar]
  • 7. T. IBARAKI, Shortest Path Problems Visiting Specified Nodes, Electronics and Communications in Japan, Vol. 53-A, 1970, pp. 10-18. [MR: 307962] [Google Scholar]
  • 8. G. LAPORTE and Y. NOBERT, A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem, Operations Research Spektrum, Vol. 5, 1983, pp. 77-85. [Zbl: 0523.90088] [Google Scholar]
  • 9. G. LAPORTE and Y. NOBERT, Finding the Shortest Cycle through k Specified Nodes, Cahiers du GERAD G-83-07, Ecole des Hautes Études Commerciales de Montréal, 1983, 11pages. [MR: 734366] [Zbl: 0534.05039] [Google Scholar]
  • 10. G. LAPORTE, M. DESROCHERS and Y. NOBERT, Two Exact Algorithme for the Distance Constrained Vehicle Routing Problem, Networks, Vol 14, 1984, pp. 161-172. [Zbl: 0538.90093] [Google Scholar]
  • 11. P. MILIOTIS, G. LAPORTE and Y. NOBERT, Computational Comparison of Two Methods for Finding the Shortest Complete Cycle or Circuit in a Graph, R.A.I.R.O, (recherche opérationnelle), Vol. 15, 1981, pp.233-239. [EuDML: 104787] [MR: 637194] [Zbl: 0472.90066] [Google Scholar]
  • 12. J. MUNKRES, Algorithms for the Assignment and Transportation Problems, Journal of S.I.A.M., Vol. 5, No. 1, 1957, p. 32. [MR: 93429] [Zbl: 0083.15302] [Google Scholar]
  • 13. J. P. SAKSENA and S. KUMAR, The Routing Problem with "K" Specified Nodes, Operations Research, Vol. 14, 1966, pp. 909-913. [Zbl: 0142.16803] [Google Scholar]
  • 14. D. M. SHAPIRO, Algorithms for the Solution of the Optimal Cost and Bottleneck Travelling Salesman Problems, Ph. D. Thesis, Washington University, 1966, 157 pp. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.