A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ro:2007021 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO:2007021 / rank | |||
Normal rank | |||
Latest revision as of 08:11, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for a resource-constrained scheduling problem |
scientific article |
Statements
A branch-and-cut algorithm for a resource-constrained scheduling problem (English)
0 references
1 June 2011
0 references
polyhedral combinatorics
0 references
scheduling
0 references
branch-and-cut
0 references
distributed systems
0 references
0 references
0 references
