A min-flow algorithm for minimal critical set detection in resource constrained project scheduling (Q456733)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A min-flow algorithm for minimal critical set detection in resource constrained project scheduling |
scientific article; zbMATH DE number 6094047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A min-flow algorithm for minimal critical set detection in resource constrained project scheduling |
scientific article; zbMATH DE number 6094047 |
Statements
A min-flow algorithm for minimal critical set detection in resource constrained project scheduling (English)
0 references
16 October 2012
0 references
constraint-based scheduling
0 references
constraint programming
0 references
precedence constraint posting
0 references
minimal critical set
0 references
min-flow algorithm
0 references
0 references
0 references
0.7737439870834351
0 references
0.7661358714103699
0 references
0.7541027069091797
0 references
