Journal of Computational Chemistry · 1981 · 18 citations · 7 references
ComputingComputer ScienceAlgorithmsOptimizationTopologyCombinatorial OptimizationLattice StructuresChainsLattice Design
Abstract In this article an algorithm to generate self‐avoiding chains fitting a predefined lattice is described. The lattice has to fulfill some mild conditions but can be one, two, or many dimensional. The chains are random in the sense that they are calculated in such a way that every chain fitting the lattice has the same chance to be constructed.
7
Chemical applications of graph theory
W.J.O.-T. · Journal of Molecular Structure · 1977 · 493 citations
The Traveling Salesman Problem: A Survey
Mandell Bellmore, George L. Nemhauser · Operations Research · 1968 · 404 citations
A statistical approach to the tsp
Bruce Golden · Networks · 1977 · 63 citations · Full text