Free Access
| Issue |
RAIRO-Oper. Res.
Volume 13, Number 1, 1979
|
|
|---|---|---|
| Page(s) | 23 - 35 | |
| DOI | https://doi.org/10.1051/ro/1979130100231 | |
| Published online | 06 February 2017 | |
- 1. J. F. BENDERS, Partitioning procedures for silving mixed variables programming problems, Numerische Mathematik, vol. 4, 1962, p. 238-252. [EuDML: 131533] [MR: 147303] [Zbl: 0109.38302] [Google Scholar]
- 2. R. GILMORE, Optimal and suboptimal algorithms for the quadratic assignment problem, S.I.A.M., vol. 10, 1962, p. 305-313. [MR: 172696] [Zbl: 0118.15101] [Google Scholar]
- 3. P. L. HAMMER et A. A. LUBIN, Some remarks on quadratic programming with 0-1 variables, R.A I.R.O., vol. 3, septembre 1970, p. 67-79. [EuDML: 104505] [MR: 274033] [Zbl: 0211.52104] [Google Scholar]
- 4. A. HENRY-LABORDÈRE, Analyse de données, applications et méthodes, Masson, 1977. [MR: 458729] [Google Scholar]
- 5. P. HUARD, Programme Dual, dans Mathématique des programmes économiquep. 13-17, Dunod, 1964. [Zbl: 0204.19505] [Google Scholar]
- 6. S. C. JOHNSON, Hierarchical clustering schemes, Psychometrika, vol. 32, n° 3, septembre 1967. [Google Scholar]
- 7. C. E. LEMKE, Bimatrix equilibrium points and mathematical programming, Management science, vol 11, n° 7, mai 1965. [MR: 189823] [Zbl: 0139.13103] [Google Scholar]
- 8. C. E. LEMKE et K. SPIELBERG, Direct Search Algorithms for zero-one and mixed integer programming problems, J.O.R.S.A., vol. 15, n° 5, 1967. [MR: 281494] [Zbl: 0168.18201] [Google Scholar]
- 9. J. B. ROSEN, Convex partition programming, dans Recent advances in mathematical programming, Graves et Wolfe ed., McGraw-Hill, 1963, p. 159-176. [MR: 163763] [Zbl: 0229.90040] [Google Scholar]
- 10. I. G. ROSENBERG, 0-1 optimisation and non linear programming, R.A I.R.O., vol. 2, octobre 1972, , p. 95-97. [EuDML: 104551] [Zbl: 0255.90029] [Google Scholar]
- 11. H. SALKIN et K. SPIELBERG, , Enumerative methods for integer and mixed integer programming IBM, N. Y. Scientific Center, Rep. n° 20-29, mars 1968. [Google Scholar]
- 12. K. SPIELBERG, , Algorithms for the simple plant location problem with someside conditions, Operations Res., 17, janvier 1969, p. 85-111. [Zbl: 0165.54104] [Google Scholar]
- 13. L. R. BAHL et D. T. TANG, Optimization of concentrators locations in Teleprocessing networks, Symposium on computer communications networks, Polytechnic institute of Brooklyn, 4-6 avril, 1972. [Google Scholar]
- 14. P. BERNARD, J. J. DAMLAMIAN, G. GLANDIER et J. P. MAURY, CENTRAC : Programme d'optimisation de la structure des réseaux téléphoniques urbains, Échodes Recherches (C.N.E.T.), n° 53, juin 1968. [Google Scholar]
- 15. J. L. DEBIESE, Le programme ÉPICURE II, Écho des Recherches (C.N.E.T.), n° 82, octobre 1975. [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.