Results 1 to 10 of about 219,959 (317)
SIAM Journal on Computing, 2020 We present a black-box reduction from the path version of the Traveling Salesman Problem (Path TSP) to the classical tour version (TSP). More precisely, we show that given an $ $-approximation algorithm for TSP, then, for any $ >0$, there is an $( + )$-approximation algorithm for the more general Path TSP.
Traub, Vera +2 more
openaire +4 more sources
Age and Sex Impact the Role of Thrombospondin‐2 and Thrombospondin‐5 in Response to Hindlimb Ischemia [PDF]
FASEB BioAdvancesPeripheral arterial disease progression to critical limb ischemia remains a significant burden in the aged, necessitating revascularization. Therapies to enhance neovascularization, such as angiogenesis or arteriogenesis, may provide an option for ...
Ashley A. Peters +6 more
doaj +2 more sources
H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem [PDF]
AAAI Conference on Artificial Intelligence, 2023 We propose an end-to-end learning framework based on hierarchical reinforcement learning, called H-TSP, for addressing the large-scale Traveling Salesman Problem (TSP).
Xuanhao Pan +6 more
semanticscholar +1 more source
Improving Ant Colony Optimization Efficiency for Solving Large TSP Instances [PDF]
Applied Soft Computing, 2022 Ant Colony Optimization (ACO) is a family of nature-inspired metaheuristics often applied to finding approximate solutions to difficult optimization problems. Despite being significantly faster than exact methods, the ACOs can still be prohibitively slow,
R. Skinderowicz
semanticscholar +1 more source
Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances [PDF]
AAAI Conference on Artificial Intelligence, 2020 For the traveling salesman problem (TSP), the existing supervised learning based algorithms suffer seriously from the lack of generalization ability. To overcome this drawback, this paper tries to train (in supervised manner) a small-scale model, which ...
Zhang-Hua Fu, K. Qiu, H. Zha
semanticscholar +1 more source
A (slightly) improved approximation algorithm for metric TSP [PDF]
Symposium on the Theory of Computing, 2020 For some > 10−36 we give a randomized 3/2− approximation algorithm for metric TSP.
Anna R. Karlin, N. Klein, S. Gharan
semanticscholar +1 more source
Health risk and predictive equation for PM2.5 using TSP and PM10 variables in office buildings [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 Total suspended particle (TSP) and particulate matter (PM10 and PM2.5) were measured at 35 office buildings in Thailand. This study aimed (1) to characterize the concentrations of TSP, PM10, and PM2.5 in office buildings, (2) to determine health risk ...
Thanakrit Neamhom +3 more
doaj +1 more source
An Enhanced Swap Sequence-Based Particle Swarm Optimization Algorithm to Solve TSP
IEEE Access, 2021 The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony ...
Bibi Aamirah Shafaa Emambocus +4 more
semanticscholar +1 more source
FOOD DELIVERY BASED ON PSO ALGORTIHM AND GOOGLE MAPS [PDF]
Applied Computer Science, 2020 This article presents a solution to deal with the optimization of delivery routes problem for a mobile application focused on the restaurant sector, by using a bioinspired algorithm (PSO) to minimize delivery costs, maximize a greater number of ...
Sergio SOTO +5 more
doaj +1 more source
COMP and TSP-4: Functional Roles in Articular Cartilage and Relevance in Osteoarthritis
International Journal of Molecular Sciences, 2021 Osteoarthritis (OA) is a slow-progressing joint disease, leading to the degradation and remodeling of the cartilage extracellular matrix (ECM). The usually quiescent chondrocytes become reactivated and accumulate in cell clusters, become hypertrophic ...
K. Maly +4 more
semanticscholar +1 more source