The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

Let tsp(G) denote the length of a shortest travelling salesman tour in a graph G. We prove that for any ε > 0, there exists a simple 2-connected planar cubic graph G1 such that tsp(G1) ≥ (1.25 − ε) · |V (G1)|, a simple 2-connected bipartite cubic graph G2 such that tsp(G2) ≥ (1.2 − ε) · |V (G2)|, and a simple 3-connected cubic graph G3 such that tsp(G3) ≥ (1.125− ε) · |V (G3)|.

Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities. We propose approximate and exact algorithms for several natur...

We explored the role that thrombospondin (TSP). a multifunctional extracellular matrix protein, plays in hematopoietic cell-cell and cell-matrix interactions. Thrombospondin synthesis is differentially regulated in human long-term bone marrow cultures. Consistent with this, human hematopoietic progenitor cells of all three lineages (erythrocyte, megakaryocyte, and granulocyte) use TSP as an att...

Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities. We propose approximate and exact algorithms for several natur...

OBJECTIVE To identify clinical and immunological markers associated with HTLV-I associated myelopathy/tropical spastic paraparesis (HAM/TSP). METHOD 237 HTLV-I infected individuals were clinically assessed. They were classified according to the Expanded Disability Status Scale (EDSS) and Osames Motor Disability Score (OMDS). Cytokine levels were determined in HTLV-I seropositive individuals. ...

Derived from the well-known Traveling Salesman problem (TSP), the multiple-Traveling Salesman problem (multiple-TSP) with single depot is a straightforward generalization: several salesmen located in a given city (the depot) need to visit a set of interconnected cities, such that each city is visited exactly once (by a single salesman) while the total cost of their tours is minimized. Designed ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

BACKGROUND AND OBJECTIVE Chronic hypoxia induces pulmonary hypertension in mice. Smooth muscle cell hyperplasia and medial thickening characterize the vasculature of these animals. Thrombospondin-1 null (TSP-1(-/-)) mice spontaneously develop pulmonary smooth muscle cell hyperplasia and medial thickening. In addition, TSP-1 produced by the pulmonary endothelium inhibits pulmonary artery smooth ...