Computational complexity and algorithms for two scheduling problems under linear constraints (Q6495885)
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: Computational complexity and algorithms for two scheduling problems under linear constraints |
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
