One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362834424 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2012.09.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010701510 / rank | |||
Normal rank | |||
Latest revision as of 20:03, 19 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
