Pages that link to "Item:Q1209661"

The following pages link to On estimating the number of order ideals in partial orders, with some applications (Q1209661):

Displaying 9 items.

• On Whitney numbers of the order ideals of generalized fences and crowns (Q1011689) (← links)
• An algorithm to generate the ideals of a partial order (Q1086160) (← links)
• The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
• The number of partial orders of fixed width (Q1362577) (← links)
• On some partial orders associated to generic initial ideals (Q1581439) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. (Q2454050) (← links)
• Bounding the roots of ideal and open set polynomials (Q2571017) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)