Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489)
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: Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems |
scientific article; zbMATH DE number 6763761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems |
scientific article; zbMATH DE number 6763761 |
Statements
Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (English)
0 references
24 August 2017
0 references
approximation algorithm
0 references
fractional optimization
0 references
integrated network design and scheduling
0 references
complexity analysis
0 references
0 references
0 references
0 references
0.88986117
0 references
0 references
0.8817733
0 references
0.87363476
0 references
0.8732921
0 references
0.8715967
0 references
0.8713904
0 references
0.8705294
0 references
0.8704065
0 references
