z-logo
open-access-imgOpen Access
Modified transitive closure algorithm for traveling salesman problems
Author(s) -
T. Karthy,
K. Ganesan
Publication year - 2020
Publication title -
aip conference proceedings
Language(s) - Uncategorized
Resource type - Conference proceedings
SCImago Journal Rank - 0.177
H-Index - 75
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/5.0026103
Subject(s) - travelling salesman problem , transitive closure , closure (psychology) , benchmark (surveying) , algorithm , computer science , java , mathematical optimization , function (biology) , transitive relation , 2 opt , mathematics , combinatorics , geodesy , evolutionary biology , economics , market economy , biology , programming language , geography

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