Random Trees and the Analysis of Branch and Bound Procedures
- 1 January 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (1) , 163-188
- https://doi.org/10.1145/2422.322422
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Optimizing decision trees through heuristically guided searchCommunications of the ACM, 1978
- Branching from the largest upper bound Folklore and factsEuropean Journal of Operational Research, 1978
- Branch-and-bound procedure and state—space representation of combinatorial optimization problemsInformation and Control, 1978
- The Power of Dominance Relations in Branch-and-Bound AlgorithmsJournal of the ACM, 1977
- Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman ProblemsPublished by Elsevier ,1977
- Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1976
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- Ordered cycle lengths in a random permutationTransactions of the American Mathematical Society, 1966