Determining the \(K\)-best solutions of knapsack problems (Q342015): 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.cor.2014.03.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066502861 / rank | |||
Normal rank | |||
Revision as of 02:27, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the \(K\)-best solutions of knapsack problems |
scientific article |
Statements
Determining the \(K\)-best solutions of knapsack problems (English)
0 references
17 November 2016
0 references
knapsack problems
0 references
branch-and-bound
0 references
best solutions
0 references
