A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846)
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 2193927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for scheduling of projects with variable-intensity activities |
scientific article; zbMATH DE number 2193927 |
Statements
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (English)
0 references
8 August 2005
0 references
Project scheduling
0 references
Network flows, Polyhedral combinatorics
0 references
Branch-and-cut
0 references
0 references
0.8729158639907837
0 references
0.8382089138031006
0 references
0.8264537453651428
0 references
0.8244374394416809
0 references
