Free Access
| Issue |
RAIRO-Oper. Res.
Volume 15, Number 2, 1981
|
|
|---|---|---|
| Page(s) | 153 - 164 | |
| DOI | https://doi.org/10.1051/ro/1981150201531 | |
| Published online | 06 February 2017 | |
- 1. J. P. BARTHES et D. WILDE, Linear Branching Algorithmes in Combinatorial Optimizations, Stanford University, Engineering, Design division. [Google Scholar]
- 2. G. H. BRADLEY, P. L. HAMMER et L. WOLSEY, Coefficient Reduction for Inequalities in 0-1 Variables, Department of Combinatorics and Optimization, University of Waterloo, Canada, Research report corr. 73-6, mars 1973. [MR: 368751] [Google Scholar]
- 3. G. H. BRADLEY et P. R. WAHI, An Algorithm jor Integer Linear Programming: A Combined Algebraic and Enumeration Approach, Administrative Sciences, Yale, Report n° 29, décembre 1969, révisé février 1971. [Zbl: 0265.90032] [Google Scholar]
- 4. D. G. DANNENBRING, Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems, Management Science, vol. 23, n° 12, août 1977, p. 1273-1283. [Zbl: 0377.90051] [Google Scholar]
- 5. J. DELORME et E. HEURGON, Problèmes de partitionnement : Exploration arborescente ou méthode de troncatures, R.A.I.R.O., 9e année, vol. 2, juin 1975, p. 53-65. [EuDML: 104617] [Zbl: 0307.90055] [Google Scholar]
- 6. R. GARFINKEL et G. NEMHAUSER, Integer Programming, John Wiley and Sons, NewYork, 1972. [MR: 381688] [Zbl: 0259.90022] [Google Scholar]
- 7. R. S. GARFINKEL et G. L. NEMHAUSER, The Set-Partitioning Problem: set Covering with Equality Constraints, Operational research, vol. 17, 1969, p. 848-856 [Zbl: 0184.23101] [Google Scholar]
- 8. M. GONDRAN et J. L. LAURIÈRE, Un algorithme pour les problèmes de recouvrement, R.A.I.R.O., 9e année, vol. 2, juin 1975, p. 33-51. [EuDML: 104616] [MR: 456455] [Zbl: 0325.90043] [Google Scholar]
- 9. M. GONDRAN et J. L. LAURIÈRE, Un algorithme pour le problème de partitionnement, R.A.I.R.O., 8e année, vol. 1, janvier 1974, p. 27-40. [EuDML: 104583] [Zbl: 0272.90045] [Google Scholar]
- 10. G. A. GORRY et J. F. SHAPIRO, An Adaptive Group. Theoretic Algorithm for Integer Programming Problems, Management Science, vol. 17, n° 5, janvier 1971, p. 285-306. [Zbl: 0227.90036] [Google Scholar]
- 11. H. GREEBERG, Integer Programming, Academic press, New York, 1971. [Google Scholar]
- 12. Guide de l'Université de Compiègne, 1976-1977, U.T.C, 60200 Compiègne. [Google Scholar]
- 13. R. W. HAISE, L. D. NELSON et T. RADO, Computer Studies of a Certain Class of Linear integer Problems, Ohio State University Research Foundation. [Zbl: 0146.41007] [Google Scholar]
- 14. P. L. HAMMER, E. L. JOHSON et U. N. PELED, Regular 0-1 Programs, Department of Combinatorics and Optimization, Research report corr 73-18, University of Waterloo, Canada, septembre 1973. [Google Scholar]
- 15. P. L. HAMMER, M. W. PADBERG et U. N. PELED, Constraint Pairing in Integer Programming, Department of Combinatorics and Optimization, Research report corr 73-7, avril 1973, University of Waterloo, Canada. [Zbl: 0303.90041] [Google Scholar]
- 16. E. HEURGON, Développement actuel des méthodes de construction automatique des tableaux de service, R.A.I.R.O., recherche opérationnelle, vol. 10, n° 2, février 1976, p. 113-119. [EuDML: 104632] [Google Scholar]
- 17. F. S. HILLIER, A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables, Department of operations research, Stanford University, Technical report n° 11, 20 mai 1969. [MR: 246635] [Zbl: 0176.49904] [Google Scholar]
- 18. F. S. HILLIER, Efficient Heuristic Procedures for Integer Linear Programming with an Interior, Department of operations research, Stanford University, Technical report n° 2, 28 février 1969. [MR: 395814] [Zbl: 0176.49902] [Google Scholar]
- 19. A. KAUFMANN et A. HENRY-LABORE, Méthodes et modèles de la recherche opérationnelle, tomes 1, 2, 3, Dunod, Paris, 1970, 1972, 1974. [Zbl: 0321.90038] [Google Scholar]
- 20. P. KROLAC, The Bounded Variable Algorithm for String Integer Linear ProgrammingProblems, Thesis, Washington University, janvier 1968, Saint-Louis, Missouri. [Google Scholar]
- 21. J. P. LEGENDRE et M. MINOUX, Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions, R.A.I.R.O., vol. 11, n° 2, mai 1977, p. 201-222. [EuDML: 104661] [MR: 489867] [Zbl: 0362.90038] [Google Scholar]
- 22. B. ROY, Algèbre moderne et théorie des groupes, Dunod, Paris, 1970. [MR: 260413] [Google Scholar]
- 23. D. S. RUBIN, Integral Solutions of Integral Linear Systems, University of Chicago. [Google Scholar]
- 24. H. THIRIEZ, The set Covering Problem: a Group Theoretic Approach, R.A.I.R.O., 5e année, vol. 3, octobre 1973, p. 83-104. [Zbl: 0266.90039] [Google Scholar]
- 25. M. VAYSSADE et J. P. A. BARTHES, PAF 1 .0, U.T.C., mai, p. 76-23. [Google Scholar]
- 26. Stelios H. ZANAKIS, Heuristic 0 . 1 Linear Programming; an Experimental Comparison of three Methods, Management Science, vol. 24, n° 1, september 1977, p. 91-103. [MR: 521087] [Zbl: 0369.90086] [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.