Pages that link to "Item:Q5953342"
From MaRDI portal
The following pages link to The computational complexity of the criticality problems in a network with interval activity times (Q5953342):
Displayed 17 items.
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- A path enumeration approach for the analysis of critical activities in fuzzy networks (Q713412) (← links)
- On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
- On the latest starting times and criticality of activities in a network with imprecise durations (Q988966) (← links)
- A minmax regret approach to the critical path method with task interval times (Q1011286) (← links)
- The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
- A simple approach to fuzzy critical path analysis in project networks (Q1031604) (← links)
- Some methods for evaluating the optimality of elements in matroids with ill-known weights (Q1037947) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- Computing latest starting times of activities in interval-valued networks with minimal time lags (Q1044116) (← links)
- Fuzzy shortest path problems incorporating interactivity among paths. (Q1426738) (← links)
- On computing the latest starting times and floats of activities in a network with imprecise durations (Q1770714) (← links)
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge (Q1869705) (← links)
- On latest starting times and floats in activity networks with ill-known durations (Q1869710) (← links)
- On the hardness of evaluating criticality of activities in a planar network with duration intervals (Q1870004) (← links)
- Analysis of critical paths in a project network with fuzzy activity times (Q2370365) (← links)