One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362834424 |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 22:40, 13 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-level reformulation of the bilevel Knapsack problem using dynamic programming |
scientific article |
Statements
One-level reformulation of the bilevel Knapsack problem using dynamic programming (English)
0 references
13 March 2013
0 references
bilevel programming
0 references
Knapsack problem
0 references
dynamic programming
0 references
branch-and-bound
0 references
