✦ LIBER ✦

Scaling the neural TSP algorithm

✍ Scribed by R. Cuykendall; R. Reese

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 537 KB
Volume: 60
Category: Article
ISSN: 0340-1200
DOI: 10.1007/bf00204774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the Euclide

Approximation algorithms for the Euclidean bipartite TSP

✍ Andreas Baltz; Anand Srivastav 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We study approximation results for the Euclidean bipartite traveling salesman problem (TSP). We present the first worstcase examples, proving that the approximation guarantees of two known polynomial-time algorithms are tight. Moreover, we propose a new algorithm which displays a superior average ca

Neural network training via an affine sc

Neural network training via an affine scaling quadratic optimization algorithm

✍ Theodore B. Trafalis; Nicolas P. Couellan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 511 KB

Algorithms for the universal and a prior

Algorithms for the universal and a priori TSP

✍ Frans Schalekamp; David B. Shmoys 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 125 KB

A probabilistic analysis of the switchin

A probabilistic analysis of the switching algorithm for the euclidean TSP

✍ Walter Kern 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 266 KB

Additive Scaling and the DIRECT Algorith

Additive Scaling and the DIRECT Algorithm

✍ D. E. Finkel; C. T. Kelley 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 251 KB

On the bigℳin the affine scaling algorit

On the bigℳin the affine scaling algorithm

✍ Tohru Ishihara; Masakazu Kojima 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 498 KB