z-logo
open-access-imgOpen Access
A Polynomial Time Algorithm of a Traveling Salesman Problem
Author(s) -
Sang-Un Lee
Publication year - 2013
Publication title -
journal of the korea society of computer and information
Language(s) - English
Resource type - Journals
eISSN - 2383-9945
pISSN - 1598-849X
DOI - 10.9708/jksci.2013.18.12.075
Subject(s) - travelling salesman problem , time complexity , algorithm , mathematics , polynomial , 2 opt , combinatorics , mathematical optimization , computer science , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom