no. 3
Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 3, pp. 307-318 
@article{RO_1993__27_3_307_0,
     author = {Quilliot, A. and Godano, S.},
     title = {Algorithmes de poursuite pour la r\'esolution de programmes (lin\'eaires) en nombres entiers},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {307--318},
     year = {1993},
     publisher = {EDP Sciences},
     volume = {27},
     number = {3},
     mrnumber = {1241865},
     language = {fr},
     url = {https://www.numdam.org/item/RO_1993__27_3_307_0/}
}
TY  - JOUR
AU  - Quilliot, A.
AU  - Godano, S.
TI  - Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1993
SP  - 307
EP  - 318
VL  - 27
IS  - 3
PB  - EDP Sciences
UR  - https://www.numdam.org/item/RO_1993__27_3_307_0/
LA  - fr
ID  - RO_1993__27_3_307_0
ER  - 
%0 Journal Article
%A Quilliot, A.
%A Godano, S.
%T Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1993
%P 307-318
%V 27
%N 3
%I EDP Sciences
%U https://www.numdam.org/item/RO_1993__27_3_307_0/
%G fr
%F RO_1993__27_3_307_0
Quilliot, A.; Godano, S. Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers. RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 3, pp. 307-318. https://www.numdam.org/item/RO_1993__27_3_307_0/

1. C. Berger, Graphes et hypergraphes, Dunod, 1974. | Zbl | MR

2. R. Bixby et W. Cuningham, Converting linear Programs to Network Problems, Maths. of Operat. Research, 5, 1098, p. 321-357. | Zbl | MR

3. V. Chvatal, Linear programming, Freeman, New York, 1983. | Zbl | MR

4. P. Chrétienne et R. Faure, Processus stochastiques, leurs graphes et usages, Gauthier-Vilîars, 1974. | Zbl

5. J. Edmonds et F. Giles, Total dual integrality of linear inequality Systems, in Progress in Combinatorial optimization, Academic Press, Toronto, 1984, p. 117-129. | Zbl | MR

6. S. Feller, An Introduction to Probability Theory and its Application, New York-London, John Wiley, 1957. | Zbl

7. M. Garey et D. Johnsson, Computer and Intractability, W. Freeman and Co, New York, 1979. | Zbl

8. F. Giles et W. Pulleyblank, Total dual integrality and integer polyedra, Linear Algebra and Application, 25, 1979, p. 191-196. | Zbl | MR

9. A. Hoffman et J. Krustal, Integral boundary points of convex polyedra, in Linear inequalities and related Systems, H. Kuhn and A. Tucker eds., Princeton Univ. Press, 1986, p. 223-246. | Zbl | MR

10. L. Kanal et V. Kumal, Search in Artificial Intelligence, Springer-Verlag, 1988. | Zbl | MR

11. S. Kirkpatrick, C. Gelatt et M. Vecchit, Optimization by simulated annealing RC 9355, 4/2/82 Computer Science/Engineering technology, IBM T. J. Watson Center New York. | MR

12. H. Lenstra, Integer programming with a fîxed number of variables, Maths. of Operat. Research, 8, 1983, p. 538-548. | Zbl | MR

13. M. Minoux, Programmation Mathématiques : Théorie et Algorithmes, Tomes 1, 2, Dunod, 1983. | Zbl | MR

14. C. Papadimitriou et K. Steiglitz, Combinatorial optimization (chap. 3, 4, 5), Prentice Hall, 1982. | Zbl | MR

15. J. Pearl, Heuristics, Prentice Hall, 1986.

16. M. Sakarovicth, Optimization combinatoire, Herman, 1984.

17. P. Siarry et G. Dreyfus, La méthode du recuit simulé, I.E.S.T., Paris, 1988.

18. A. Schrijver, Theory of linear and integer programming, (chap. 19, 20), John Wiley Interscience, 1986. | Zbl | MR