LSVMK Langrangian Support Vector Machine algorithm
LSVMK solves a support vector machine problem using an iterative
algorithm inspired by an augmented Lagrangian formulation.
遺傳算法和“貨郎擔(dān)” 問題:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
