Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165): 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.1007/978-3-642-22616-8_31 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W55710781 / rank | |||
Normal rank | |||
Latest revision as of 23:31, 19 March 2024
scientific article; zbMATH DE number 5938192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for a Bi-level Knapsack Problem |
scientific article; zbMATH DE number 5938192 |
Statements
Approximation Algorithms for a Bi-level Knapsack Problem (English)
0 references
12 August 2011
0 references
bilevel knapsack problem
0 references
approximation algorithms
0 references
