Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 936 for “"TSP"”.
-
On Applying Methods for Graph-TSP to Metric TSP
… 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 …
-
Aplikace mravenčních algoritmů na TSP
… obchodního cestujícího -- variantě vícenásobného TSP, která zavádí další omezení na to, které město může být navštíveno kterým obchodníkem. Dále je čtenář seznámen s některými exaktním a heuristickými algoritmy, které byly v minulosti použity k řešení TSP. Práce se blíže věnuje optimalizaci …
-
Pokročilá evoluční optimalizace úloh typu TSP
… algoritmů či jiného přístupu k řešení TSP.
-
Aplikace mravenčích algoritmů v rozsáhlých úlohách TSP
… cestujúci (angl. Traveling Salesman Problem - TSP). Jednou triedou metód, ktoré sa ukázali byť v riešení TSP veľmi nápomocné, sú mravčie algoritmy. Narazili však na svoj limit - vysoký počet miest v inštancii, kedy sa už stali kvôli časovej a pamäťovej náročnosti takmer nepoužiteľné. Cieľom …
-
A Parallel Implementation of A Greedy TSP Algorithm
The Traveling Salesman Problem has often been used as an exploration ground for building heuristics to calculate the shortest path of a complete graph that traverse every vertex exactly once. This has a number of important practical applications. Since it is an NP-hard problem, many heuristics have …
-
TSP-1 in Osteoclastogenesis and Osteolytic Bone Metastasis
… The matricellular protein thrombospondin-1 (TSP-1) plays a pivotal role in tumor microenvironment (TME) organization and tumor-TME interactions, with context-specific pro- and anti- tumor activities. TSP-1 is composed by multiple domains, each characterized by a specific pattern of …
-
Using DP-constraints to obtain improved TSP solutions.
The Travelling Salesman Problem (TSP) is a well-known NP-hard problem. Although it is unlikely that an efficient algorithm will ever be found for the TSP, some success has been achieved for large real-world instances by using the branch and cut technique. This technique requires knowledge of …
-
Optimalizace úloh typu TSP technikami kolektivní výpočetní inteligence
Cílem této práce je porovnání algoritmů kolektivní výpočetní inteligence pro optimalizaci rozsáhlých instancí problémů obchodního cestujícího obsahující až několik tisíc měst. Tato práce bude zaměřená na optimalizace, které jsou založené na chování hejna a optimalizace, které jsou založené na …
-
TSP-1 reduced the size of episcleral veins
… studies indicated that Thrombospondin-1 (TSP-1) expression is higher in glaucomatous eyes and TSP1-deficient mice exhibit lowered IOP, suggesting TSP-1 plays a role in regulating IOP. A preliminary study in the Gong Lab has showed that TSP-1 decreased outflow facility in porcine eyes. This …
-
Optimal selection of operators in genetic algorithm for tsp /
The Travelling Salesman Problem aims to discover Hamiltonian cycle route through the cities positioned on a two-dimensional space. This optimization problem presents a traditional challenge for which different solution methods apply. The article examines the genetic solution method based on natural …
-
A Massively Parallel Exact TSP Solver for Small Problem Sizes
The Traveling Salesman Problem (TSP) is a combinatorial optimization problem tasked with finding the shortest tour for visiting a set of cities such that each city is visited exactly once, and the tour ends in the starting city. This problem has gained attention among researchers because it is easy …
-
TSP 90 - Los enfoques de liderazgo en las empresas modernas
En la actualidad, las empresas modernas deben tener estrategias que les permitan identificar o crear nuevas necesidades para los mercados, generar una mayor competitividad, ser socialmente responsables y poseer una visión global. En este contexto, se evidenció que uno de los problemas en la …
-
Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations
… the metric s-t path Traveling Salesman Problem (TSP) via LP relaxations. We first consider the s-t path graph-TSP, a critical special case of the metric s-t path TSP. We design a new simple LP-based algorithm for the s-t path graph-TSP that achieves the best known approximation factor of 1.5. …
-
Applications of Circulations and Removable Pairings to TSP and 2ECSS
… problems: The travelling salesman problem (TSP), which aims to find a minimum cost tour that visits every node exactly once in a complete weighted graph, and the 2-edge-connected spanning subgraph problem (2ECSS), which aims to find a minimum size 2-edge-connected spanning subgraph in a …
-
Avaliação de PCA3, TSP-1, AMARC e AR no câncer de próstata
Resumo não disponível
-
Analysing the empirical time complexity of high-performance algorithms for SAT and TSP
… (SAT) and the travelling salesperson (TSP) are two of the most intensely studied problems, and it is generally believed that solving SAT or TSP requires exponential time in the worst case. In this work, we refine and extend a recent empirical scaling analysis approach and study the …
-
Finding Structure in Entropy: Improved Approximation Algorithms for TSP and other Graph Problems
… for the metric traveling salesperson problem (TSP) with approximation ratio below 3/2. This represents the first improvement in nearly half a century, answering a long-standing open problem in combinatorial optimization. The algorithm we analyze, a variant of Christofides' 3/2 approximation …
-
RUP-pe : uma metodologia ágil, baseada no RUP e no TSP, para pequenas equipes
… Além disto, também foi definido com base no TSP, um processo de software completamente alinhado com o SW-CMM. O objetivo do RUP-pe é ser uma metodologia adequada às pequenas equipes, sem ser excessivamente informal, e alinhada, desde sua definição, com um modelo de qualidade reconhecido …
Page 1 of 47