Amanote Research
Register
Sign In
A Method to Search the Optimal Hamiltonian Cycle With a Set of Approximations for Travelling Salesman Problem
doi 10.2991/eame-15.2015.182
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2015
Authors
Y. Wang
Publisher
Atlantis Press
Related search
A Genetic Method Using Hybrid Crossover for Solving Travelling Salesman Problem
International Journal of Recent Technology and Engineering
Engineering
Management of Technology
Innovation
An Electronic Algorithm to Find the Optimal Solution for the Travelling Salesman Problem
IOSR Journal of Computer Engineering
A Water Flow-Like Algorithm for the Travelling Salesman Problem
Advances in Computer Engineering
Enhancing Particle Swarm Optimization Using Opposite Gradient Search for Travelling Salesman Problem
International Journal of Computer and Communication Engineering
On Solving Travelling Salesman Problem With Vertex Requisitions
Yugoslav Journal of Operations Research
Management Science
Operations Research
Computational Experiments With Some Approximation Algorithms for the Travelling Salesman Problem
Applicationes Mathematicae
Can the Agent With Limited Information Solve Travelling Salesman Problem?
Complexity
Multidisciplinary
Computer Science
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Solution to Travelling Salesman Problem by Nature Inspired Algorithm
International Journal of Computer Applications
