Computational results with a branch-and-bound algorithm for the general knapsack problem (Q4180138): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 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.1002/nav.3800260105 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2141742819 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4082544 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4077727 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:11, 13 June 2024
scientific article; zbMATH DE number 3616189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational results with a branch-and-bound algorithm for the general knapsack problem |
scientific article; zbMATH DE number 3616189 |
Statements
Computational results with a branch-and-bound algorithm for the general knapsack problem (English)
0 references
1979
0 references
Branch-And-Bound Algorithm
0 references
Computational Study
0 references
General Knapsack Problem
0 references
