An algorithm to generate the ideals of a partial order

This publication has 8 references indexed in Scilit:

• Single Machine Scheduling with Precedence Constraints of Dimension 2
  Mathematics of Operations Research, 1984
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
  SIAM Journal on Computing, 1983
• Calculating bounds on reachability and connectedness in stochastic networks
  Networks, 1983
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
  Mathematics of Operations Research, 1983
• On Dynamic Programming Methods for Assembly Line Balancing
  Operations Research, 1982
• On the structure of all minimum cuts in a network and applications
  Published by Springer Nature ,1980
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
  Operations Research, 1978
• Vertex packings: Structural properties and algorithms
  Mathematical Programming, 1975