Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem
The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman...
Main Author: | KHAN, Muhammad Umair |
---|---|
Format: | Others |
Language: | English |
Published: |
Högskolan Dalarna, Datateknik
2010
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:du-4910 |
Similar Items
-
Graph partitioning - a survey
by: Elsner, Ulrich
Published: (2005) -
Correspondence between Multilevel Graph Partitions and Tree Decompositions
by: Michael Hamann, et al.
Published: (2019-09-01) -
Dynamic Graph Partitioning Scheme for Supporting Load Balancing in Distributed Graph Environments
by: Dojin Choi, et al.
Published: (2021-01-01) -
Graph partitioning - a survey
by: Elsner, Ulrich
Published: (2005) -
A new particle swarm intelligence-based graph partitioning technique for image segmentation
by: S. D. Kapade, et al.
Published: (2020-03-01)