Free Access
Issue |
R.A.I.R.O. Recherche opérationnelle
Volume 10, Number V1, 1976
|
|
---|---|---|
Page(s) | 55 - 70 | |
DOI | https://doi.org/10.1051/ro/197610V100551 | |
Published online | 06 February 2017 |
- 1. J. ABADIE, Une méthode arborescente pour les programmes partiellement discrets, R.I.R.O., 3e année, V 3, 1969, p. 24-50. [EuDML: 104477] [MR: 269302] [Zbl: 0193.18801] [Google Scholar]
- 2. J. ABADIE, Une méthode de résolution des programmes non linéaires partiellement discrets sans hypothèse de convexité, R.I.R.O., 5e année, V 1, 1971, p. 23-38. [EuDML: 104509] [MR: 314459] [Zbl: 0304.90085] [Google Scholar]
- 3. J. ABADIE et J. CARPENTIER, Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints, in Optimization, R. Fletcher, ed., Academic Press, New York, 1969. [MR: 284206] [Zbl: 0254.90049] [Google Scholar]
- 4. J. ABADIE et J. GUIGOU, Numerical Experiments with the GRG Method, in Integerand Nonlinear Programming, J. Abadie, ed., North-Holland Publishing Company, Amsterdam, 1970. [MR: 441347] [Zbl: 0331.65041] [Google Scholar]
- 5. E. M. L. BEALE et R. E. SMALL, Mixed Integer Programming by a Branch and Bound Technique, in Proceedings of the IFIP Congress 1965, p. 450-451, W. A. Kalenich, ed., Spartan Press, Washington D. C. , 1965. [Google Scholar]
- 6. J. BRACKEN et G. P. McCORMICK, Selected Applications of Nonlinear Programming, Wiley, New York, 1968. [MR: 233590] [Zbl: 0194.20502] [Google Scholar]
- 7. A. R. COLVILLE, A Comparative Study of Nonlinear Programming Codes, IBM NYSC Report 320-2949, 1968. [Google Scholar]
- 8. A. R. COLVILLE, A Comparative Study of Nonlinear Programming Codes, p. 487-502, in Proceedings of the Princeton Symposium on Mathematical Programming H. W. Kuhn, ed., Princeton University Press, 1970. [MR: 325248] [Zbl: 0224.90069] [Google Scholar]
- 9. R.J. DAKIN, A Tree-Search Algorithm for Mixed Integer Problems, The Computer Journal, vol. 8, 1965, p. 250-255. [MR: 187937] [Zbl: 0154.42004] [Google Scholar]
- 10. N. J. DRIEBECK, An Algorithm for the Solution of Mixed Integer Programming Problems, Management Science, vol. 12, 1966, p. 576-587. [Google Scholar]
- 11. P. L. HAMMER et S. RUDEANU, Méthodes booléennes en recherche opérationnelle, Dunod, Paris, 1970. [MR: 260409] [Zbl: 0214.18603] [Google Scholar]
- 12. D. M. HIMMELBLAU, Applied Nonlinear Programming, McGraw-Hill, New York, 1972. [Zbl: 0241.90051] [Google Scholar]
- 13. A.H. LAND et A. G. DOIG, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol. 28, 1960, p.497-520. [MR: 115825] [Zbl: 0101.37004] [Google Scholar]
- 14. P. LE FAOU, Une méthode arborescente pour la résolution des programmes linéaires partiellement en nombres entiers,Thèse de 3e cycle, Université Paris VI, Paris, 1973. [Google Scholar]
- 15. J. D. C. LITTLE, K. C. MURTY, D. W. SWEENEY et C. KAREL, An Algorithm for the Traveling Salesman Problem, Operations Research, vol. 11, 1963, p. 972-989. [Zbl: 0161.39305] [Google Scholar]
- 16. J. C. T MAO, Quantitative Analysis of Financial Decision, The MacMillan Company, Collier-MacMillan Limited, Londres, 1969. [Google Scholar]
- 17. J. B. ROSEN et S. SUZUKI, Construction of Nonlinear Programming Test Problems, Commun. A.C.M., vol. 8, 1965, p. 113. [Google Scholar]
- 18. B. ROY, R. BENAYOUN et J. TERGNY, From S.E.P. Procedure to the Mixed OPHELIE Program, in Integer and Nonlinear Programming, J. Abadie, ed., North-Holland Publishing Company, Amsterdam, 1970. [MR: 437034] [Zbl: 0334.90044] [Google Scholar]
- 19. J. A. TOMLIN, Branch and Bound Methods for Integer and Non-Convex Programming, in Integer and Nonlinear Programming, J. Abadie, ed., North-Holland Publishing Company, Amsterdam, 1970. [MR: 437037] [Zbl: 0336.90038] [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.