On estimating the number of order ideals in partial orders, with some applications
From MaRDI portal
Publication:1209661
DOI10.1016/0378-3758(93)90012-UzbMath0777.06004MaRDI QIDQ1209661
Publication date: 16 May 1993
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
widthdensityenumerationrecursionpolynomial time algorithmantichainsorder idealsregression equations2-dimensional ordered sets
Related Items (5)
Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ On Whitney numbers of the order ideals of generalized fences and crowns ⋮ The use of dynamic programming in genetic algorithms for permutation problems ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- An algorithm to generate the ideals of a partial order
- Complement reducible graphs
- A decomposition theorem for partially ordered sets
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- A Dynamic Programming Approach to Sequencing Problems
- Single Machine Scheduling with Precedence Constraints of Dimension 2
- Average properties of two-dimensional partial orders
- Calculating bounds on reachability and connectedness in stochastic networks
- Searching in Trees, Series-Parallel and Interval Orders
- Scheduling Problems with a Singular Solution
- Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
This page was built for publication: On estimating the number of order ideals in partial orders, with some applications
