An algorithm to generate the ideals of a partial order

DOI10.1016/0167-6377(86)90071-4zbMath0608.90075OpenAlexW2070280587MaRDI QIDQ1086160

George Steiner

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90071-4

zbMATH Keywords

ideals of a partially ordered set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (20)

Characterizing isometries on the order polytope with an application to the theory of fuzzy measures ⋮ Tree structure for distributive lattices and its applications ⋮ Maximal closure on a graph with resource constraints ⋮ Finding a Level Ideal of a Poset ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Efficient generation of the ideals of a poset in Gray code order. II ⋮ On-line computations of the ideal lattice of posets ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ On estimating the number of order ideals in partial orders, with some applications ⋮ Efficient algorithms on distributive lattices ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ On extensions, linear extensions, upsets and downsets of ordered sets ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ Learning Bayesian network parameters under order constraints ⋮ Algorithmic combinatorics based on slicing posets ⋮ Efficient generation of the ideals of a poset in Gray code order ⋮ On Whitney numbers of the order ideals of generalized fences and crowns ⋮ Extracting maximal information about sets of minimum cuts ⋮ Gray codes from antimatroids ⋮ Skyline groups are ideals. An efficient algorithm for enumerating skyline groups

Cites Work

• Unnamed Item
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Single Machine Scheduling with Precedence Constraints of Dimension 2
• Calculating bounds on reachability and connectedness in stochastic networks
• On the structure of all minimum cuts in a network and applications
• On Dynamic Programming Methods for Assembly Line Balancing
• Scheduling Problems with a Singular Solution
• Vertex packings: Structural properties and algorithms
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

This page was built for publication: An algorithm to generate the ideals of a partial order