Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources (Q707776)
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: Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources |
scientific article; zbMATH DE number 5797512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources |
scientific article; zbMATH DE number 5797512 |
Statements
Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources (English)
0 references
8 October 2010
0 references
critical path method (CPM)
0 references
honey-bee mating optimization (HBMO)
0 references
constrained/unconstrained resources
0 references
0 references
0 references
0 references
0 references
0.7647119760513306
0 references
0.7567340731620789
0 references
0.7537373304367065
0 references
