Technical Note—On the Expected Performance of Branch-and-Bound Algorithms

DOI10.1287/OPRE.26.2.347MaRDI QIDQ4161085zbMATH OpenOpenAlexFDO

Authors Alexander H. G. Rinnooy Kan, Jan Karel Lenstra

Publication date 1978

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.26.2.347

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 3908167
• Random Trees and the Analysis of Branch and Bound Procedures
• scientific article; zbMATH DE number 4189104
• A note on the complexity of the asymmetric traveling salesman problem
• Improving the performance of enumerative search methods. II: Computational experiments

Cited in

(10)

• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• An appraisal of computational complexity for operations researchers
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
• A note on the complexity of the asymmetric traveling salesman problem
• A study of complexity transitions on the asymmetric traveling salesman problem
• Random Trees and the Analysis of Branch and Bound Procedures
• Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
• scientific article; zbMATH DE number 49948 (Why is no real title available?)
• Solving a random asymmetric TSP exactly in quasi-polynomial time w.h.p.
• Average-case analysis of best-first search in two representative directed acyclic graphs

This page was built for publication: Technical Note—On the Expected Performance of Branch-and-Bound Algorithms

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