Problème de la bipartition minimale d'un graphe
Catherine Roucairol; Pierre Hansen
RAIRO - Operations Research - Recherche Opérationnelle (1987)
- Volume: 21, Issue: 4, page 325-348
- ISSN: 0399-0559
Access Full Article
topHow to cite
topReferences
top- 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. Zbl0505.05050MR679649
- 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. Zbl0678.90061
- 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. Zbl0321.05123MR405911
- 4. M. GAREY, E. JOHNSON et STOCKMEYER, Some Simplified NP-Complete Problems, Theoretical Computer Science, vol. 1, 1976, p. 237-267. Zbl0338.05120MR411240
- 5. P.L. HAMMER (Ivanescu), Some Network Flow Problems Solved by Pseudo-Boolean Programming, Operations Research, vol. 13, 1965, p. 388-299. Zbl0132.13804MR184728
- 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. Zbl0303.90014
- 7. M. MINOUXProgrammation Mathématique, t. 1, C.N.E.T., E.N.S.T., Dunod, Paris, 1983. Zbl0546.90056
- 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. Zbl0391.90041MR509428
- 9. A. NIJENHUIS et H. S. WILF, Combinatorial Algorithms, Second Edition, Academic Press, New York, 1978. Zbl0343.68004MR510047
- 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.
- 11. J. C. PICARD et H. D. RATLIFF, Minimum Cuts and Related Problems, Networks, vol. 5, 1975, p. 357-370. Zbl0325.90047MR391960
- 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. Zbl0452.90051MR597274
- 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.