Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
From MaRDI portal
Publication:4161085
DOI10.1287/opre.26.2.347zbMath0381.90077MaRDI QIDQ4161085
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
Related Items
Average-case analysis of best-first search in two representative directed acyclic graphs, 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, Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck