A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00335-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007363252 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 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
0 references
0 references
0 references
0 references
0 references
