An Enumeration Algorithm for Knapsack Problems (Q5591244): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1287/opre.18.2.306 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2148214747 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:18, 19 March 2024
scientific article; zbMATH DE number 3310596
Language | Label | Description | Also known as |
---|---|---|---|
English | An Enumeration Algorithm for Knapsack Problems |
scientific article; zbMATH DE number 3310596 |
Statements
An Enumeration Algorithm for Knapsack Problems (English)
0 references
1970
0 references
operations research
0 references