Reducing the number of paths in a minimized project-network with given bounds on the durations of activities (Q4575164)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6903068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing the number of paths in a minimized project-network with given bounds on the durations of activities |
scientific article; zbMATH DE number 6903068 |
Statements
12 July 2018
0 references
project-network
0 references
dominant path
0 references
heuristic possibilistic clustering
0 references
interval-valued data
0 references
stationary clustering structure
0 references
typical point
0 references
Reducing the number of paths in a minimized project-network with given bounds on the durations of activities (English)
0 references
0.8775133
0 references
0.85849744
0 references
0 references
0.8413458
0 references
