Free Access
| Issue |
RAIRO-Oper. Res.
Volume 27, Number 3, 1993
|
|
|---|---|---|
| Page(s) | 307 - 318 | |
| DOI | https://doi.org/10.1051/ro/1993270303071 | |
| Published online | 06 February 2017 | |
- 1. C. BERGER, Graphes et hypergraphes, Dunod, 1974. [MR: 357173] [Zbl: 0213.25702] [Google Scholar]
- 2. R. BIXBY et W. CUNINGHAM, Converting linear Programs to Network Problems, Maths. of Operat. Research, 5, 1098, p. 321-357. [MR: 594849] [Zbl: 0442.90095] [Google Scholar]
- 3. V. CHVATAL, Linear programming, Freeman, New York, 1983. [MR: 717219] [Zbl: 0537.90067] [Google Scholar]
- 4. P. CHRÉTIENNE et R. FAURE, Processus stochastiques, leurs graphes et usages, Gauthier-Vilîars, 1974. [Zbl: 0293.60060] [Google Scholar]
- 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. [MR: 771873] [Zbl: 0555.90078] [Google Scholar]
- 6. S. FELLER, An Introduction to Probability Theory and its Application, New York-London, John Wiley, 1957. [Zbl: 0077.12201] [Google Scholar]
- 7. M. GAREY et D. JOHNSSON, Computer and Intractability, W. Freeman and Co, New York, 1979. [Zbl: 0411.68039] [Google Scholar]
- 8. F. GILES et W. PULLEYBLANK, Total dual integrality and integer polyedra, Linear Algebra and Application, 25, 1979, p. 191-196. [MR: 528725] [Zbl: 0413.90054] [Google Scholar]
- 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. [MR: 85148] [Zbl: 0072.37803] [Google Scholar]
- 10. L. KANAL et V. KUMAL, Search in Artificial Intelligence, Springer-Verlag, 1988. [MR: 1019092] [Zbl: 0648.68104] [Google Scholar]
- 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: 702485] [Google Scholar]
- 12. H. LENSTRA, Integer programming with a fîxed number of variables, Maths. of Operat. Research, 8, 1983, p. 538-548. [MR: 727410] [Zbl: 0524.90067] [Google Scholar]
- 13. M. MINOUX, Programmation Mathématiques : Théorie et Algorithmes, Tomes 1, 2, Dunod, 1983. [EuDML: 274801] [MR: 714150] [Zbl: 0546.90056] [Google Scholar]
- 14. C. PAPADIMITRIOU et K. STEIGLITZ, Combinatorial optimization (chap. 3, 4, 5), Prentice Hall, 1982. [MR: 663728] [Zbl: 0503.90060] [Google Scholar]
- 15. J. PEARL, Heuristics, Prentice Hall, 1986. [Google Scholar]
- 16. M. SAKAROVICTH, Optimization combinatoire, Herman, 1984. [Google Scholar]
- 17. P. SIARRY et G. DREYFUS, La méthode du recuit simulé, I.E.S.T., Paris, 1988. [Google Scholar]
- 18. A. SCHRIJVER, Theory of linear and integer programming, (chap. 19, 20), John Wiley Interscience, 1986. [MR: 874114] [Zbl: 0970.90052] [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.