Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:28, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints |
scientific article |
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
