A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems |
scientific article |
Statements
A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (English)
0 references
28 June 2010
0 references
dynamic programming
0 references
exact algorithm
0 references
graphical algorithm
0 references
partition problem
0 references
Knapsack problem
0 references
