Computational complexity and algorithms for two scheduling problems under linear constraints (Q6495885): Difference between revisions
From MaRDI portal
Latest revision as of 19:47, 30 December 2024
scientific article; zbMATH DE number 7841575
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity and algorithms for two scheduling problems under linear constraints |
scientific article; zbMATH DE number 7841575 |
Statements
Computational complexity and algorithms for two scheduling problems under linear constraints (English)
0 references
2 May 2024
0 references
0 references