On the NP-hardness of two scheduling problems under linear constraints (Q6535800)
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: On the NP-hardness of two scheduling problems under linear constraints |
scientific article; zbMATH DE number 7810582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the NP-hardness of two scheduling problems under linear constraints |
scientific article; zbMATH DE number 7810582 |
Statements
On the NP-hardness of two scheduling problems under linear constraints (English)
0 references
28 February 2024
0 references
scheduling
0 references
linear programming
0 references
computational complexity
0 references
0 references
0.9400649070739746
0 references
0.8946107625961304
0 references
0.8634276986122131
0 references
0.8529818654060364
0 references
