Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2018.04.013 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130037988 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2018.04.013 / rank | |||
Normal rank | |||
Latest revision as of 01:03, 11 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
