Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518)
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: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem |
scientific article; zbMATH DE number 22572
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem |
scientific article; zbMATH DE number 22572 |
Statements
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (English)
0 references
26 June 1992
0 references
high multiplicity scheduling
0 references
strongly polynomial algorithms
0 references
greedy algorithm
0 references
