๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the nearest neighbor rule for the traveling salesman problem

โœ Scribed by Cor A.J. Hurkens; Gerhard J. Woeginger


Book ID
108410492
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
227 KB
Volume
32
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A new nearest-neighbor rule in the patte
โœ Kazuo Hattori; Masahito Takahashi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

A new nearest-neighbor (NN) rule is proposed. In this rule, the k-nearest neighbors of an input sample are obtained in each class. Two classification examples are presented to test the NN rule proposed. The number of samples misclassified N is evaluated. The minimum of N in the the NN rule proposed

A Note on the Traveling Salesman Problem
โœ Jones, Lee ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 324 KB