Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Vitaly A. Strusevich / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C09 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6555670 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
half-product | |||
Property / zbMATH Keywords: half-product / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quadratic knapsack | |||
Property / zbMATH Keywords: quadratic knapsack / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling with rejection | |||
Property / zbMATH Keywords: scheduling with rejection / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling with controllable processing times | |||
Property / zbMATH Keywords: scheduling with controllable processing times / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
FPTAS | |||
Property / zbMATH Keywords: FPTAS / rank | |||
Normal rank |
Revision as of 12:36, 27 June 2023
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