Polynomial-Space Exact Algorithms For Traveling Salesman Problem In Degree Bounded Graphs
-
Saved in:
Main Author: | Md Yunos, Norhazwani |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://eprints.utem.edu.my/id/eprint/19056/1/Polynomial-Space%20Exact%20Algorithms%20For%20Traveling%20Salesman%20Problem%20In%20Degree%20Bounded%20Graphs.pdf http://eprints.utem.edu.my/id/eprint/19056/ https://plh.utem.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=102972 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
by: Md Yunos, Norhazwani, et al.
Published: (2017) -
Solving traveling salesman problems using branch and bound methods
by: Mustafa, Mamat, et al.
Published: (2019) -
The retrace traveling salesman problem : a new extension of traveling salesman problem
by: Arbain, Juraidawati
Published: (2003) -
Genetic algorithm software for solving the travelling salesman problem
by: Sekharan, Vijayan Sandiara
Published: (1996) -
Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
by: Shakila, Saad, et al.
Published: (2014)