A dynamic programming algorithm for the bilevel Knapsack problem (Q833584): 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.orl.2009.01.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072408036 / rank | |||
Normal rank | |||
Revision as of 23:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming algorithm for the bilevel Knapsack problem |
scientific article |
Statements
A dynamic programming algorithm for the bilevel Knapsack problem (English)
0 references
14 August 2009
0 references
Knapsack problem
0 references
bilevel programming
0 references
dynamic programming
0 references
