Name
Abstract | ||
|---|---|---|
By generalising problem solving techniques such as divide-and-conquer, dynamic programming, tree and graph searching, integer
programming and branch-and-bound, a general problem solving algorithm is deduced. Various examples of the use of this algorithm
are given and its implementation on both sequential and parallel machines, such as the cosmic cube, is discussed. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1007/BF03037504 | New Generation Comput. |
Keywords | Field | DocType |
Algorithm Design,Algorithm Abstraction,Combinatorial Computing,Parallelism | Dynamic programming,Graph,Mathematical optimization,Algorithm design,Search algorithm,Computer science,Branch and cut,Branch and price,Algorithm,Theoretical computer science,Integer programming,Cube | Journal |
Volume | Issue | ISSN |
6 | 1 | 0288-3635 |
Citations | PageRank | References |
2 | 0.40 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. J. Rayward-Smith | 1 | 266 | 59.21 |
| G. P. Mckeown | 2 | 53 | 9.29 |
| F. W. Burton | 3 | 102 | 16.05 |