Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2796556323 / rank | |||
Normal rank | |||
Revision as of 18:47, 19 March 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
