Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7722424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines |
scientific article; zbMATH DE number 7722424 |
Statements
Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (English)
0 references
3 August 2023
0 references
network optimization
0 references
parallel machine scheduling
0 references
polynomial-time approximation scheme
0 references
approximation algorithm
0 references
0 references
0.9453338
0 references
0 references
0.88219905
0 references
0.8791066
0 references
0.8762766
0 references
0.8759879
0 references
0.87575585
0 references
0.8757503
0 references
