A Branch Search Algorithm for the Knapsack Problem (Q5585877): 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/mnsc.16.5.327 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066850897 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:53, 19 March 2024
scientific article; zbMATH DE number 3304554
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch Search Algorithm for the Knapsack Problem |
scientific article; zbMATH DE number 3304554 |
Statements
A Branch Search Algorithm for the Knapsack Problem (English)
0 references
1970
0 references
operations research
0 references
