An algorithm and efficient data structures for the binary knapsack problem (Q1255893): 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/0377-2217(78)90137-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061197582 / rank | |||
Normal rank | |||
Revision as of 01:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm and efficient data structures for the binary knapsack problem |
scientific article |
Statements
An algorithm and efficient data structures for the binary knapsack problem (English)
0 references
1978
0 references
Binary Knapsack Problem
0 references
Reduction Scheme
0 references
Branch and Bound Algorithm
0 references
Boolean Programming
0 references
Computational Study
0 references
