Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:37, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product |
scientific article |
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
