𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems

✍ Scribed by Martin Kolinek

Publisher
Springer
Year
1987
Tongue
English
Weight
630 KB
Volume
2
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A diagonal completion and 2-optimal proc
A diagonal completion and 2-optimal procedure for the travelling salesman problem
✍ J.R. King; X.Y. Zhang; G.H. Jin πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 934 KB

A fast diagonal completion algorithm is developed for constructing a good initial feasible solution for travelling salesman problems. The algorithm can be combined with any tour improvement approach but is specifically considered here in conjunction with the 2-optimal method which is shown to give g

Heuristic combinatorial optimization by
Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem
✍ B. K. Ambati; J. Ambati; M. M. Mokhtar πŸ“‚ Article πŸ“… 1991 πŸ› Springer-Verlag 🌐 English βš– 393 KB

A genetic algorithm simulating Darwinian evolution is proposed to yield near-optimal solutions to the Traveling Salesman Problem. Noting that Darwinian evolution is itself an optimization process, we propose a heuristic algorithm that incorporates the tenets of natural selection. The time complexity