Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems (Q4938774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems |
scientific article; zbMATH DE number 1405789 |
Statements
23 February 2000
0 references
Lagrangian lower bounds
0 references
polynomial-time algorithm
0 references
scheduling problem
0 references
Lagrangian approach
0 references
lower bounds
0 references
0.8993198275566101
0 references
0.8621066212654114
0 references
0.8620302677154541
0 references
0.8485902547836304
0 references
Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems (English)
0 references
