The following pages link to On the minimum dummy-arc problem (Q4201824):
Displaying 7 items.
- A new method for constructing a minimal PERT network (Q646227) (← links)
- Optimal constructions of reversible digraphs (Q801802) (← links)
- On the use of the complexity index as a measure of complexity in activity networks (Q1278225) (← links)
- Activity nets: A guided tour through some recent developments (Q1388902) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- Minimizing the complexity of an activity network (Q4509382) (← links)
- Analysis of the impact of corrective actions for stochastic project networks (Q6565390) (← links)