A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LOLIB / rank | |||
Normal rank | |||
Revision as of 02:17, 29 February 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
