Free Access
RAIRO-Oper. Res.
Volume 24, Number 1, 1990
Page(s) 15 - 27
Published online 06 February 2017
  • J. CARLIER et P. CHRETIENNE, Problèmes d'Ordonnancement : Modélisation/Complexité/Algorithmes, Masson Paris, 1988.
  • E. A. DINIC, Algorithm for Solution of a Problem of Maximum flow in a Network with Power Estimation, Soviet Math. Dolk., vol. 11, 1970, p. 1277-1280. [Zbl: 0219.90046]
  • R. FAURE, C. ROUCAIROL et P. TOLLA, Chemins et Flots, Ordonnancements, Gauthier-Villars, Paris, 1976. [MR: 449462] [Zbl: 0349.90126]
  • R. FAURE, Précis de Recherche Opérationnelle, Dunod, Paris, 1978.
  • L. R. FORD et D. R. FULKERSON, Maximal Flow Through a Network, Canad. J. Math., vol. 8, 1956, p. 399-404. [MR: 79251] [Zbl: 0073.40203]
  • L. R. FORD et D. R. FULKERSON, Flows in Networks, Princeton Univ. press., 1962. [MR: 159700] [Zbl: 1216.05047]
  • D. R. FULKERSON, A Network Flow Computation for Project Cost Curves, Management science, vol. 7, 1961, p. 167-178. [MR: 148474] [Zbl: 0995.90519]
  • A. V. KARZANOV, Determining the Maximal Flow in a Network by the Method of Preflows, Soviet Math. Dokl., vol 15, 1974, p. 434-437. [Zbl: 0303.90014]
  • ROSEAUX, Graphes : Leurs usages, leurs algorithmes, Masson, tome 1, 1986.
  • D. D. SLEATOR et R. E. TARJAN, A Data Structure for Dynamic Tree, J. Comput.System Sri., vol. 24, 1983. [MR: 710253] [Zbl: 0509.68058]
  • D. D. SLEATOR, An O(nm log n) Algorithm for Maximum Network Flow, Tech. Rep. STANCS-80-831, Computer science Dept., Stanford Univ., 1980.
  • R. E. TARJAN, Data Structures And Network Algorithms, Wiley, 1983. [MR: 826534] [Zbl: 0584.68077]

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.