Name
Abstract | ||
|---|---|---|
The branch-and-bound paradigm is presented as a higher-order function and illustrated by instantiations, providing two well-known branch-and-bound algorithms for the Steiner tree problem in graphs and one for the travelling salesman problem. We discuss the advantages of such a specification and various issues arising from sequential and parallel implementations of branch-and-bound kernels. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF02073942 | Annals OR |
Keywords | Field | DocType |
higher order functions,steiner tree problem,branch and bound,travelling salesman problem,branch and bound algorithm | Discrete mathematics,Graph,Mathematical optimization,Branch and bound,Combinatorics,Steiner tree problem,Travelling salesman problem,Mathematics | Journal |
Volume | Issue | Citations |
33 | 5 | 8 |
PageRank | References | Authors |
0.85 | 26 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. P. Mckeown | 1 | 53 | 9.29 |
| V. J. Rayward-Smith | 2 | 266 | 59.21 |
| H. J. Turpin | 3 | 8 | 0.85 |