@article{RO_1991__25_3_265_0, author = {Bordat, J.-P.}, title = {Calcul des id\'eaux d'un ordonn\'e fini}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {265--275}, publisher = {EDP-Sciences}, volume = {25}, number = {3}, year = {1991}, mrnumber = {1128468}, zbl = {0733.90038}, language = {fr}, url = {http://archive.numdam.org/item/RO_1991__25_3_265_0/} }
Bordat, J.-P. Calcul des idéaux d'un ordonné fini. RAIRO - Operations Research - Recherche Opérationnelle, Volume 25 (1991) no. 3, pp. 265-275. http://archive.numdam.org/item/RO_1991__25_3_265_0/
1. Efficient Polynomial Algorithms for Distributive Lattices, accepté pour publication par Discrete Appl. Math. | MR | Zbl
,2. The Calculation of Invariants for Ordered Sets, Algorithms and Order, I. RIVAL éd., Kluwer Acad. Publ., Dordrecht, 1989, p. 231-279. | MR
et ,3. Minimizing Setups in Ordered Sets with Fixed Width, Order, 1985, 1, p. 225-229. | MR | Zbl
et ,4. A Decomposition Theorem for Partially Ordered Sets, Ann. of Math., 1950, 51, p. 161-166. | MR | Zbl
,5. General lattice Theory, Academic Press, 1978. | MR | Zbl
,6. Efficient Implementation of Dynamic Programming Algorithms for Sequencing Problems, Rep. BW106/79, Stichting Matematisch Centrum, Amsterdam, 1979. | Zbl
,7. Recent Developments in Deterministic Sequencing and Scheduling: A Survey, M. A. H. DEMPSTER et al., éd., Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, p. 35-73. | MR | Zbl
, et ,8. Scheduling Problems with a Singular Solution, Discrete Appl. Math., 1982, 16, p.225-239. | MR | Zbl
,9. Computationally Tractable Classes of Ordered Sets, Algorithms and Order, I. RIVAL éd., Kluwer Acad. Publ., Dordrecht, 1989, p.105-113. | MR
,10. Vertex Packings: Structural Properties and Algorithms, Math. Progr., 1975, 8, p. 232-248. | MR | Zbl
et ,11. Structure of All Minimum Cuts in a Network and Applications, Math. Progr. Study, 1980, 13, p. 8-16. | MR | Zbl
et ,12. Order-Theoretic Aspects of Scheduling, Combinatorics and Ordered sets (Arcata, Calif.), 1985, p. 1-32, Contemp. Math., 57, Amer. Math. Soc., Providence, R. I., 1986. | MR | Zbl
,13. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected, SIAM J. Comput., 1983, 12, p. 777-788. | MR | Zbl
et ,14. Dynamic Programming Solution for Sequencing Problems with Precedence Constraints. Oper. Res., 1978, 26, p. 444-449. | Zbl
et ,15. Single Machine Scheduling with Precedence Constraints of Dimension 2, Math. Oper. Res., 1984, 9, p.248-259. | MR | Zbl
,16. An Algorithm to Generate the Ideals of a Partial Order, Oper. Res. Letters, 1986, 5, p.317-320. | MR | Zbl
,17. On Computing the Information Theoretic Bound for Sorting: Counting the Linear Extensions of Posets; Res. Report n° 87459-OR, McMaster University, Hamilton, Ontario, Canada, 1987.
,