A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-004-0551-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-004-0551-6 / rank | |||
Normal rank | |||
Latest revision as of 23:22, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for scheduling of projects with variable-intensity activities |
scientific article |
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
