Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695)
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 schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints |
scientific article; zbMATH DE number 6902946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints |
scientific article; zbMATH DE number 6902946 |
Statements
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (English)
0 references
12 July 2018
0 references
combinatorial optimization
0 references
non-linear Boolean programming
0 references
geometric rounding
0 references
\(K\)-approximation sets and functions
0 references
FPTAS
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89297813
0 references
0.8928764
0 references
0.8889308
0 references
0.8858098
0 references
0 references
0.8803733
0 references
0.8799084
0 references
0.87950027
0 references
0.87921506
0 references
