Polynomial-Space Exact Algorithms For Traveling Salesman Problem In Degree Bounded Graphs

Md Yunos, Norhazwani (2017) Polynomial-Space Exact Algorithms For Traveling Salesman Problem In Degree Bounded Graphs. Doctoral thesis, Universiti Teknikal Malaysia Melaka.

[img] Text (24 Pages)
Polynomial-Space Exact Algorithms For Traveling Salesman Problem In Degree Bounded Graphs.pdf - Submitted Version

Download (337kB)

Abstract

-

Item Type: Thesis (Doctoral)
Uncontrolled Keywords: Algorithms, Mathematical optimization, Roads Surveying, Travel, Traveling-salesman problem
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Divisions: Library > Tesis > FPTT
Depositing User: Muhammad Afiz Ahmad
Date Deposited: 20 Sep 2017 07:14
Last Modified: 05 Jan 2021 16:30
URI: http://eprints.utem.edu.my/id/eprint/19056
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item