A Tabu Search Approximation for Finding the Shortest Distance Using Traveling Salesman Problem

IOSR Journal of Mathematics
doi 10.9790/5728-1205058084
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOSR Journals

Related search

On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1956English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

The P-Median Problem: A Tabu Search Approximation Proposal Applied to Districts

Journal of Mathematics and System Science
2015English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

A Modified Ant Colony Algorithm for Traveling Salesman Problem

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy