Configuration space analysis of travelling salesman problems
暂无分享,去创建一个
[1] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] M. Shimrat. Algorithm 112: Position of point relative to polygon , 1962, CACM.
[3] R. Sokal,et al. Principles of numerical taxonomy , 1965 .
[4] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[5] S. Kirkpatrick,et al. Solvable Model of a Spin-Glass , 1975 .
[6] Henri Orland,et al. White and weighted averages over solutions of Thouless Anderson Palmer equations for the Sherrington Kirkpatrick spin glass , 1980 .
[7] H. Barentzen. Pair theory of the Hubbard Hamiltonian , 1982 .
[8] Giorgio Parisi,et al. Order parameter for spin-glasses , 1983 .
[9] Scott Kirkpatrick,et al. Optimization by simulated annealing: Quantitative studies , 1984 .
[10] N. Parga,et al. A numerical investigation of the overlap distribution among pure states in the spin glass phase , 1984 .
[11] M. Mézard,et al. The simplest spin glass , 1984 .
[12] M. Mézard,et al. On the statistical mechanics of optimization problems of the travelling salesman type , 1984 .
[13] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .