Free Access
R.A.I.R.O. Recherche opérationnelle
Volume 6, Number V3, 1972
Page(s) 3 - 15
Published online 06 February 2017
  • J. L. AGARD, Méthode Hongroise, Papier interne, Air France, 1965. [Google Scholar]
  • M. L. BALINSKI et R. E. GOMORY, A Primal Method for the Assignment and Transportation Problems, Management Science, vol. 10, n° 3, 1964, 578-593. [Google Scholar]
  • L. R. Jr. FORD et D. R. FULKERSON, Flows in Networks, Princeton U. Press, 1962. [MR: 159700] [Zbl: 1216.05047] [Google Scholar]
  • P. L. IVANESCU et S. RUDEANU, A pseudo-boolean approach to matching problem, in : « Théorie des graphes », Journées Internationales d'Études, Rome, juillet 1966. Publié par Dunod, Paris et Gordon and Breach, New York, 1967. [Zbl: 0141.35704] [Google Scholar]
  • H. W. KUHN, The Hungarian Method for the Assignment Problem, Nav. Res. Log. Quart., vol. 2, n° 1 et 2, 1965. [Zbl: 0143.41905] [Google Scholar]
  • B. ROY, Algèbre moderne et théorie des graphes, tome II, Chapitre 9, Dunod, Paris, 1970. [Zbl: 0238.90073] [MR: 260413] [Google Scholar]
  • I. M. STANCU-MINASIAN, The Utilization of the Graph Teory in Solving the Assignment Problem, in : « Economic Computation and Economic Cybernetics Studies and Research » (pp. 69-84). The Centre of Economic Computation and Economic, Cybernetics, Bucharest, 1970. [MR: 274006] [Zbl: 0208.45601] [Google Scholar]
  • Y. TABOURIER, Sur un algorithme d'affectation, Direction Scientifique Metra, Note de travail 139, avril 1971. [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.