A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q1200760 / rank | |||
| Property / author | |||
| Property / author: Dong X. Shaw / rank | |||
Normal rank | |||
| 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/ijoc.9.4.431 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2142105839 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:32, 20 March 2024
scientific article; zbMATH DE number 1117848
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem |
scientific article; zbMATH DE number 1117848 |
Statements
A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (English)
0 references
26 November 1998
0 references
tree knapsack problem
0 references
pseudopolynomial-time algorithm
0 references
