Skip to content
MyTheses
  • Feedback
  • Book Bag: 0 items (Full)
  • HOME
  • MYTHESES
  • BLOG
  • AI ASSISTANT
  • GUIDE & TUTORIAL
  • CONTACT
    • English
    • Français
    • 日本語
    • 中文(简体)
    • 中文(繁體)
    • اللغة العربية
    • हिंदी
Advanced
  • Polynomial-Space Exact Algorit...
  • Cite this
  • Text this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Add to Book Bag Remove from Book Bag
  • Permanent link

QR Code

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

-

Bibliographic Details
Main Author: Md Yunos, Norhazwani
Format: Thesis
Language:English
Published: 2017
Subjects:
Q Science (General)
QA Mathematics
Online Access:http://eprints.utem.edu.my/id/eprint/19056/
https://plh.utem.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=102972
Abstract Abstract here
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://eprints.utem.edu.my/id/eprint/19056/
https://plh.utem.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=102972

Similar Items

  • A genetic simplified swarm algorithm for optimizing n-cities open loop travelling salesman problem
    by: Chieng, Hock Hung
    Published: (2016)
  • On chromatic polynomials of graphs / Ho, Chee Kit.
    by: Ho, Chee Kit
    Published: (1998)
  • The exact number and size of conjugacy classes, commutativity degrees and non-commuting graphs of finite metacyclic groups
    by: Kayvan Moradipour
    Published: (2025)
  • Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
    by: Spencer Embong Wakat
    Published: (2025)
  • Linear spaces and preservers of persymmetric triangular matrices of bounded rank-two / Ng Zhen Chuan
    by: Ng, Zhen Chuan
    Published: (2012)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs