On the strength of time-indexed formulations for the resource-constrained project scheduling problem (Q1728175)
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: On the strength of time-indexed formulations for the resource-constrained project scheduling problem |
scientific article; zbMATH DE number 7027507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the strength of time-indexed formulations for the resource-constrained project scheduling problem |
scientific article; zbMATH DE number 7027507 |
Statements
On the strength of time-indexed formulations for the resource-constrained project scheduling problem (English)
0 references
22 February 2019
0 references
resource-constrained project scheduling
0 references
the linear programming
0 references
time-indexed variables
0 references
on/off variables
0 references
relaxation strength
0 references
non-singular transformations
0 references
0 references
0 references
0 references
0 references
0.8367464542388916
0 references
0.7864459156990051
0 references
0.7826134562492371
0 references
0.7797530889511108
0 references
