GA_Traffic The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years two entire monograph

java语音编写的程序，用来求自然数底e的近似值-java program written in the voice, to find an approximation of the natural log base e

提供级数法和Lanczos逼近法计算伽马函数近似值，java语言编写-Provide progression method and Lanczos approximation to calculate the gamma function approximation, java language