An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem (Q3637393): 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.1287/opre.51.5.826.16757 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047182666 / rank | |||
Normal rank | |||
Revision as of 23:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem |
scientific article |
Statements
An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem (English)
0 references
9 July 2009
0 references
