One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: One-level reformulation of the bilevel Knapsack problem using dynamic programming |
scientific article; zbMATH DE number 6144142
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-level reformulation of the bilevel Knapsack problem using dynamic programming |
scientific article; zbMATH DE number 6144142 |
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
