The vehicle routing problem

 Access to full text

 Full (PDF)

1. 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. Zbl0193.18801MR269302
2. 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. Zbl0304.90085MR314459
3. 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. Zbl0254.90049MR284206
4. 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. Zbl0331.65041MR441347
5. 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. 
6. 6. J. BRACKEN et G. P. McCORMICK, Selected Applications of Nonlinear Programming, Wiley, New York, 1968. Zbl0194.20502MR233590
7. 7. A. R. COLVILLE, A Comparative Study of Nonlinear Programming Codes, IBM NYSC Report 320-2949, 1968. 
8. 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. Zbl0224.90069MR325248
9. 9. R.J. DAKIN, A Tree-Search Algorithm for Mixed Integer Problems, The Computer Journal, vol. 8, 1965, p. 250-255. Zbl0154.42004MR187937
10. 10. N. J. DRIEBECK, An Algorithm for the Solution of Mixed Integer Programming Problems, Management Science, vol. 12, 1966, p. 576-587. 
11. 11. P. L. HAMMER et S. RUDEANU, Méthodes booléennes en recherche opérationnelle, Dunod, Paris, 1970. Zbl0214.18603MR260409
12. 12. D. M. HIMMELBLAU, Applied Nonlinear Programming, McGraw-Hill, New York, 1972. Zbl0241.90051
13. 13. A.H. LAND et A. G. DOIG, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol. 28, 1960, p.497-520. Zbl0101.37004MR115825
14. 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. 
15. 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. Zbl0161.39305
16. 16. J. C. T MAO, Quantitative Analysis of Financial Decision, The MacMillan Company, Collier-MacMillan Limited, Londres, 1969. 
17. 17. J. B. ROSEN et S. SUZUKI, Construction of Nonlinear Programming Test Problems, Commun. A.C.M., vol. 8, 1965, p. 113. 
18. 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. Zbl0334.90044MR437034
19. 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. Zbl0336.90038MR437037

1. A. Guinet, Transports industriels routiers, un problème d'affectation avec réemploi sous contraintes