Thomas A
Department of Statistics and Computational Mathematics, Brownlow Hill, Liverpool.
IMA J Math Appl Med Biol. 1986;3(3):167-78. doi: 10.1093/imammb/3.3.167.
The problem of finding optimal peeling sequences is considered, and a correspondence between sequences and permutations of marriages is established. Several search methods, including random downhill search and the annealing algorithm, are compared. The topology of the space of all peeling sequences is discussed.
考虑了寻找最优剥离序列的问题，并建立了序列与婚姻排列之间的对应关系。比较了几种搜索方法，包括随机下山搜索和退火算法。讨论了所有剥离序列空间的拓扑结构。
