Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209)
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 6555670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product |
scientific article; zbMATH DE number 6555670 |
Statements
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (English)
0 references
15 March 2016
0 references
scheduling
0 references
half-product
0 references
quadratic knapsack
0 references
scheduling with rejection
0 references
scheduling with controllable processing times
0 references
FPTAS
0 references
0 references
0 references
0 references
0.854590654373169
0 references
0.8505064249038696
0 references
0.8499821424484253
0 references
0.8161525726318359
0 references
0.8034853935241699
0 references
