A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem (Q2892296)
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 6047413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem |
scientific article; zbMATH DE number 6047413 |
Statements
18 June 2012
0 references
project scheduling
0 references
multiple resources
0 references
integer linear programming
0 references
branch and cut
0 references
A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem (English)
0 references
0.8571164011955261
0 references
0.8476300239562988
0 references
0.8474247455596924
0 references
0.8430877327919006
0 references
