A Branch Search Algorithm for the Knapsack Problem (Q5585877): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/mnsc.16.5.327 / 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MNSC.16.5.327 / rank | |||
Normal rank | |||
Latest revision as of 18:12, 30 December 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
