A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PSPLIB / rank | |||
Normal rank | |||
Revision as of 11:53, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the resource-constrained project scheduling problem |
scientific article |
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
