A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56050294 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.30.6.765 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108088553 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:40, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem |
scientific article |
Statements
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (English)
0 references
1984
0 references
knapsack problem
0 references
branch and bound
0 references
Subset-Sum Problem
0 references
depth-first tree search algorithm
0 references
randomly generated test problems
0 references
mixed algorithm
0 references
large sized problems
0 references
