A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084)
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 branch and bound algorithm for the resource-constrained project scheduling problem |
scientific article; zbMATH DE number 1314772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the resource-constrained project scheduling problem |
scientific article; zbMATH DE number 1314772 |
Statements
A branch and bound algorithm for the resource-constrained project scheduling problem (English)
0 references
21 October 2001
0 references
branch and bound method
0 references
immediate selection
0 references
resource-constrained project scheduling problems
0 references
disjunctive graph model
0 references
0 references
0 references
0 references
0 references
0 references
0.9227888584136964
0 references
0.9102516770362854
0 references
