Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
RAIRO - Operations Research - Recherche Opérationnelle (1993)
- Volume: 27, Issue: 3, page 307-318
- ISSN: 0399-0559
Access Full Article
top
How to cite
topQuilliot, A., and Godano, S.. "Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers." RAIRO - Operations Research - Recherche Opérationnelle 27.3 (1993): 307-318. <http://eudml.org/doc/105063>.
@article{Quilliot1993,
author = {Quilliot, A., Godano, S.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {stochastic methods; heuristics; linear integer constraints},
language = {fre},
number = {3},
pages = {307-318},
publisher = {EDP-Sciences},
title = {Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers},
url = {http://eudml.org/doc/105063},
volume = {27},
year = {1993},
}
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
PB - EDP-Sciences
VL - 27
IS - 3
SP - 307
EP - 318
LA - fre
KW - stochastic methods; heuristics; linear integer constraints
UR - http://eudml.org/doc/105063
ER -
References
top- 1. C. BERGER, Graphes et hypergraphes, Dunod, 1974. Zbl0213.25702MR357173
- 2. R. BIXBY et W. CUNINGHAM, Converting linear Programs to Network Problems, Maths. of Operat. Research, 5, 1098, p. 321-357. Zbl0442.90095MR594849
- 3. V. CHVATAL, Linear programming, Freeman, New York, 1983. Zbl0537.90067MR717219
- 4. P. CHRÉTIENNE et R. FAURE, Processus stochastiques, leurs graphes et usages, Gauthier-Vilîars, 1974. Zbl0293.60060
- 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. Zbl0555.90078MR771873
- 6. S. FELLER, An Introduction to Probability Theory and its Application, New York-London, John Wiley, 1957. Zbl0077.12201
- 7. M. GAREY et D. JOHNSSON, Computer and Intractability, W. Freeman and Co, New York, 1979. Zbl0411.68039
- 8. F. GILES et W. PULLEYBLANK, Total dual integrality and integer polyedra, Linear Algebra and Application, 25, 1979, p. 191-196. Zbl0413.90054MR528725
- 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. Zbl0072.37803MR85148
- 10. L. KANAL et V. KUMAL, Search in Artificial Intelligence, Springer-Verlag, 1988. Zbl0648.68104MR1019092
- 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. MR702485
- 12. H. LENSTRA, Integer programming with a fîxed number of variables, Maths. of Operat. Research, 8, 1983, p. 538-548. Zbl0524.90067MR727410
- 13. M. MINOUX, Programmation Mathématiques : Théorie et Algorithmes, Tomes 1, 2, Dunod, 1983. Zbl0546.90056MR714150
- 14. C. PAPADIMITRIOU et K. STEIGLITZ, Combinatorial optimization (chap. 3, 4, 5), Prentice Hall, 1982. Zbl0503.90060MR663728
- 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. Zbl0970.90052MR874114
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.