Free Access
Issue
RAIRO-Oper. Res.
Volume 13, Number 1, 1979
Page(s) 13 - 21
DOI https://doi.org/10.1051/ro/1979130100131
Published online 06 February 2017
  • 1. M. GONDRAN et M. MINOUX, Graphes et algorithmes. A paraître chez Eyrolles, 1979. [MR: 615739] [Zbl: 0497.05023]
  • 2. R. KARP, On the computational Complexity of Combinatorial problems. Network, 5, 1975, p. 45-68. [Zbl: 0324.05003]
  • 3. C. BERGE, Graphes et hypergraphes. Dunod, 1970. [MR: 357173] [Zbl: 0213.25702]
  • 4. A. J. HOFFMAN et J. B. KRUSKAL, Integral boundary points of convex polyhedra. Ann. of Math. Studies, 38, Princeton, p. 223. [MR: 85148] [Zbl: 0072.37803]
  • 5. J. AGARD, J. P. ARABEYRE et J. VAUTIER, Génération automatique de rotation d'équipages, R.A.I.R.O., n° 6, 1967, p. 107-117.
  • 6. M. MINOUX, Hypergraphes d'intervalles et problèmes de flots. Communication orale.
  • 7. M. GONDRAN, Les problèmes de partition et de recouvrement : applications et algorithmes, Bulletin de la Direction des Études et Recherches E.D.F., série C, n° 2, 1976, p. 59-68. [MR: 541230]
  • 8. F. GLOVER, Maximum Matching in a Convex Bipartite Graph, Naval Res. Logist. Quart., n° 14, 1967, p. 313-316. [Zbl: 0183.24501]
  • 9. E. LAWLER, Combinatorial Optimization : Networds and matroids, Holt, Rinchart and Winston, 1976. [MR: 439106] [Zbl: 0413.90040]

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.