Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches-Reference-Cited by-同舟云学术

Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches

Published:2000-04 Issue:5 Volume:27 Page:461-494
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Altinel İ.Kuban,Aras Necati,Oommen B.John

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference62 articles.

1. TSPLIB – a traveling salesman problem library;Reinelt;ORSA Journal on Computing,1991

2. Papadimitriou CH, The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science. 1978; 4:237–44.

3. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem: a guided tour of combinatorial optimization. Chichester: Wiley, 1985.

4. Reinelt G. The traveling salesman. Computational solutions for TSP applications. Berlin: Springer, 1994.

5. An effective heuristic algorithm for the traveling salesman problem;Lin;Operations Research,1973

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem;Transport Policy;2022-11

2. Novel Autonomous Algorithms of Path Planning for Mobile Robots: A Survey;2021 Australian & New Zealand Control Conference (ANZCC);2021-11-25

3. An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem;Neurocomputing;2012-07

4. Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem;Computers & Operations Research;2012-02

5. The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals;IIE Transactions;2010-08-31