Amanote Research

Amanote Research

    RegisterSign In

Realization of Procedures Permuting Traveling Routes Like the K-Opt by the Linked State Transition Neural Neworks for the Traveling Salesman Problems

IEEJ Transactions on Electronics, Information and Systems - Japan
doi 10.1541/ieejeiss1987.116.7_809
Full Text
Open PDF
Abstract

Available in full text

Categories
Electronic EngineeringElectrical
Date

January 1, 1996

Authors
Eitaro AiyoshiAtsushi YoshikawaTakuya Wakutsu
Publisher

Institute of Electrical Engineers of Japan (IEE Japan)


Related search

Hamiltonicity and the 3-Opt Procedure for the Traveling Salesman Problem

Applicationes Mathematicae
1994English

On Labeled Traveling Salesman Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Optimization of Postal Routes by Genetic Algorithm for Solving the Multiple Traveling Salesman Problem

CBU International Conference Proceedings
2015English

The Traveling Salesman Problem

English

Online Traveling Salesman Problems With Rejection Options

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2014English

Traveling Salesman Problem

2011English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

Traveling Salesman Problem

English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy