An algorithm to generate the ideals of a partial order

Authors:
George Steiner
Affiliations:
Management Science and Information Systems Area, Faculty of Business, McMaster University, Hamilton, Ont., Canada L8S 4M4
Venue:
Operations Research Letters
Year:
1986

Citing 0
Cited 5

Efficient generation of the ideals of a poset in Gray code order

Information Processing Letters
Characterizing isometries on the order polytope with an application to the theory of fuzzy measures

Information Sciences: an International Journal
Adjacency on the order polytope with applications to the theory of fuzzy measures

Fuzzy Sets and Systems
Learning Bayesian network parameters under order constraints

International Journal of Approximate Reasoning
Efficient generation of the ideals of a poset in gray code order, part II

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generating the ideals of a partially ordered set is an important, frequently occurring problem in scheduling, reliability, sensitivity analysis for network flows and other combinatorial optimization problems. In this paper we present an algorithm which generates all the ideals of a partial order on n elements in O(n) time per ideal.