Random Trees and the Analysis of Branch and Bound Procedures

DOI10.1145/2422.322422MaRDI QIDQ3028342zbMATHOpenAlexFDO

Authors Douglas R. Smith

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422.322422

zbMATH Keywords

traveling salesman problemNP-hard problemsdiscrete optimizationaverage case complexitysearchinglabeled treessearch strategiesbranch and bound proceduresrelaxation-guided procedures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1334602
• Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
• Performance of linear-space search algorithms
• Branch and bound on the network model
• Branch and bound on the network model

Cited in

(25)

• An algorithm for the Lorenz measure in locational decisions on trees
• Modeling of uplink power control for cognitive radio networks: cooperative and noncooperative
• On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search
• On the stochastic complexity of the asymmetric traveling salesman problem
• Lower bounds on the size of general branch-and-bound trees
• Estimation of parameters in the tree order restriction by a randomized decision
• scientific article; zbMATH DE number 1334602 (Why is no real title available?)
• A study of complexity transitions on the asymmetric traveling salesman problem
• State-Space Search
• On a tail bound for analyzing random trees
• Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
• scientific article; zbMATH DE number 1444332 (Why is no real title available?)
• Analysis of the space of search trees under the random insertion algorithm
• scientific article; zbMATH DE number 1456964 (Why is no real title available?)
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
• The hierarchical model of branch planning with random coefficients
• A randomized parallel branch-and-bound algorithm
• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
• A note on the complexity of the asymmetric traveling salesman problem
• Estimating the Size of Branch-and-Bound Trees
• Performance of linear-space search algorithms
• Parallel best-first branch-and-bound in discrete optimization: a framework
• Towards an abstract parallel branch and bound machine
• Performance of linear-space search algorithms

This page was built for publication: Random Trees and the Analysis of Branch and Bound Procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028342)