Results 121 to 130 of about 31,072 (147)

Polynomial Reduction of TSP to Freely Open-loop TSP

2019 2nd International Conference of the IEEE Nigeria Computer Chapter (NigeriaComputConf), 2019
Travelling Salesman Problem (TSP) is one of the earliest combinatorial problem that is identified to be NP-hard problem. It is a problem that seeks to find the shortest possible route in a graph problem which passes through all nodes only once and return to the starting point. A variant of TSP is the Freely Open-loop TSP (FOTSP) which seeks to find the
Muhammad Bashir Abdulrazaq, Yusuf Suleiman Tahir, Suleiman Sha’aban, Muhammed Sani Jibia   +3 more
openaire   +1 more source

The Kth TSP is pseudopolynomial when TSP is polynomial

Discrete Mathematics, Algorithms and Applications, 2018
Given an undirected graph [Formula: see text] with a weight function [Formula: see text], and a positive integer [Formula: see text], the Kth Traveling Salesman Problem (Kth TSP) is to find [Formula: see text] Hamilton cycles [Formula: see text] such that, for any Hamilton cycle [Formula: see text], we have [Formula: see text]. This problem is NP-hard
openaire   +1 more source

TSP-1, TSP-2, and TSP-5 demonstrate sexual dimorphism in intimal hyperplasia in rats and mice

American Journal of Physiology-Heart and Circulatory Physiology
Thrombospondins (TSPs) are matricellular proteins involved in intimal hyperplasia (IH). We demonstrate in vitro, TSP-1, TSP-2, and TSP-5 affect one another and influence vascular smooth muscle cell proliferation and migration. In vivo, using a rat and mouse model of IH, we show that TSPs demonstrate a sexual dimorphism that may explain differences ...
Ashley A. Peters, Furqan Muqri, Corinne Bunn, Mohammed Kassem, Alex Helkin, David Bruch, Kristopher G. Maier, Vivian Gahtan   +7 more
openaire   +2 more sources

On Applying Methods for Graph-TSP to Metric TSP

2016
The Metric Travelling Salesman Problem, henceforth metric TSP, is a fundamental problem in combinatorial optimization which consists of finding a minimum cost Hamiltonian cycle (also called a TSP tour) in a weighted complete graph in which the costs are metric. Metric TSP is known to belong to a class of problems called NP-hard even in the special case
openaire   +2 more sources

TSP

2008
Shashi Shekhar, Hui Xiong
openaire   +2 more sources

TSP

2011
  +4 more sources

TSP Software

2007
Andrea Lodi, Abraham P. Punnen
openaire   +1 more source

TSPS Introduction

Annals of Plastic Surgery, 2017
openaire   +2 more sources

HAM/TSP

Nature Reviews Disease Primers, 2015
openaire   +2 more sources

TSP

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source