Pages that link to "Item:Q3329201"
From MaRDI portal
The following pages link to Single Machine Scheduling with Precedence Constraints of Dimension 2 (Q3329201):
Displayed 12 items.
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- An algorithm to generate the ideals of a partial order (Q1086160) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- Understanding the generalized median stable matchings (Q1959721) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- The minimum dummy task problem (Q3787785) (← links)