A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918)
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: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem |
scientific article; zbMATH DE number 3617545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem |
scientific article; zbMATH DE number 3617545 |
Statements
A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (English)
0 references
1978
0 references
Knapsack Problem
0 references
Linear Search Tree Program
0 references
Lower Bound
0 references
