Free Access
RAIRO-Oper. Res.
Volume 21, Number 4, 1987
Page(s) 325 - 348
Published online 06 February 2017
  • 1. E. R. BARNES, An Algorithm for Partitioning the Notes of a Graph, S.I.A.M. J. Alg. Disc. Meth., vol., n° 4, 1982, p. 541-550. [MR: 679649] [Zbl: 0505.05050] [Google Scholar]
  • 2. P. CHAILLOU, P. HANSEN et Y. MAHIEU, Best Network Flow Bounds for the Quadratic Knapsack Problem, Presented at NETFLOW 83 International Workshop, Pisa, Italy, 1983. [Zbl: 0678.90061] [Google Scholar]
  • 3. N. CHRISTOFIDÈS et P. BROOKER, The Optimal Partitioning of Graphs, S.I.A.M. J. Apl. Math., vol. 30, n° 1, 1976, p. 55-70. [MR: 405911] [Zbl: 0321.05123] [Google Scholar]
  • 4. M. GAREY, E. JOHNSON et STOCKMEYER, Some Simplified NP-Complete Problems, Theoretical Computer Science, vol. 1, 1976, p. 237-267. [MR: 411240] [Zbl: 0338.05120] [Google Scholar]
  • 5. P.L. HAMMER (Ivanescu), Some Network Flow Problems Solved by Pseudo-Boolean Programming, Operations Research, vol. 13, 1965, p. 388-299. [MR: 184728] [Zbl: 0132.13804] [Google Scholar]
  • 6. A. V. KARZANOV, Determining the Maximal Flow in at Network by the Method of Preflows, Soviet. Math. Dokl., vol. 15, 1974, p. 434-437. [Zbl: 0303.90014] [Google Scholar]
  • 7. M. MINOUX Programmation Mathématique, t. 1, C.N.E.T., E.N.S.T., Dunod, Paris, 1983. [Zbl: 0546.90056] [Google Scholar]
  • 8. V. M. MALHORTA, M. P. KUMAR et S. N. MAHESHWARI, An Algorithm for Finding Maximum Flow in Networks, Information Processing Letters, vol.7-6, 1978, p. 277-278. [MR: 509428] [Zbl: 0391.90041] [Google Scholar]
  • 9. A. NIJENHUIS et H. S. WILF, Combinatorial Algorithms, Second Edition, Academic Press, New York, 1978. [MR: 510047] [Zbl: 0343.68004] [Google Scholar]
  • 10. J. C. PICARD et M. QUEYRANNE, Networks, Graphs and Some Non Linear 0.1 Programming Problems, Tech. Rep. EP77-R-32, École Polytechnique de Montréal, Canada, , 1977. [Google Scholar]
  • 11. J. C. PICARD et H. D. RATLIFF, Minimum Cuts and Related Problems, Networks, vol. 5, 1975, p. 357-370. [MR: 391960] [Zbl: 0325.90047] [Google Scholar]
  • 12. J. C. PICARD et H. D. RATLIFF, A Cut Approach to a Class of Quadratic Integer Programming Problems, Networks, vol. 10, 1980, p. 363-370. [MR: 597274] [Zbl: 0452.90051] [Google Scholar]
  • 13. P. SIARRY, La méthode du Recuit Simulé : application à la conception de circuits électroniques, Thèse de Doctorat de l'Université Paris-VI, Spécialités : Sciences Physiques, Paris, novembre 1986. [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.