A Metropolis-type optimization algorithm on the infinite tree
From MaRDI portal
Publication:1277371
DOI10.1007/PL00009231zbMath0936.68118MaRDI QIDQ1277371
Publication date: 22 April 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009231
68W05: Nonnumerical algorithms
Related Items
A survey of max-type recursive distributional equations, Asymptotics for the survival probability in a killed branching random walk, Total progeny in killed branching random walk, Performance of the Metropolis algorithm on a disordered tree: the Einstein relation, Search cost for a nearly optimal path in a binary tree, Genetic algorithms in random environments: two examples