A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems |
scientific article; zbMATH DE number 5727439
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems |
scientific article; zbMATH DE number 5727439 |
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
0.8868112
0 references
0.8821447
0 references
0.88149357
0 references
0.8731617
0 references
0.86649215
0 references
0.8660672
0 references
