A well-solvable special case of the bounded knapsack problem (Q2275577): 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.orl.2011.01.006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2131397354 / rank | |||
Normal rank |
Revision as of 21:51, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A well-solvable special case of the bounded knapsack problem |
scientific article |
Statements
A well-solvable special case of the bounded knapsack problem (English)
0 references
9 August 2011
0 references
combinatorial optimization
0 references
computational complexity
0 references
polynomial time algorithm
0 references
cross ratio ordered
0 references