Results 31 to 40 of about 77,620 (283)
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP [PDF]
, 2013 2-Opt is probably the most basic local search heuristic for the TSP. This heuristic achieves amazingly good results on “real world” Euclidean instances both with respect to running time and approximation ratio.
Matthias Englert +5 more
core +1 more source
A statistical approach to the tsp [PDF]
Networks, 1977 AbstractThis paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the well‐known NP‐complete TSP is presented, from which statistical estimates of the optimal tour length can be derived. Assumptions, along with computational experience and conclusions are discussed.
openaire +3 more sources
CoRR, 2022 We initiate the study of online routing problems with predictions, inspired by recent exciting results in the area of learning-augmented algorithms. A learning-augmented online algorithm which incorporates predictions in a black-box manner to outperform existing algorithms if the predictions are accurate while otherwise maintaining theoretical ...
Hsiao-Yu Hu +4 more
openaire +3 more sources
Therapeutic strategies in HTLV-I-associated myelopathy/tropical spastic paraparesis (HAM/TSP) [PDF]
, 2009 Human T lymphotropic virus type I (HTLV-I)-associated myelopathy/tropical spastic paraparesis (HAM/TSP) is chronic progressive myelopathy characterized by bilateral pyramidal tracts involvement with sphincteric disturbances.
Eguchi, Katsumi +2 more
core +1 more source
Tetraspanin (TSP-17) Protects Dopaminergic Neurons against 6-OHDA-Induced Neurodegeneration in C. elegans [PDF]
, 2014 Parkinson's disease (PD), the second most prevalent neurodegenerative disease after Alzheimer's disease, is linked to the gradual loss of dopaminergic neurons in the substantia nigra.
Masoudi, Neda +19 more
core +1 more source
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
Journal of Computer and System Sciences, 2022 We study the Many Visits TSP problem, where given a number $k(v)$ for each of $n$ cities and pairwise (possibly asymmetric) integer distances, one has to find an optimal tour that visits each city $v$ exactly $k(v)$ times. The currently fastest algorithm is due to Berger, Kozma, Mnich and Vincze [SODA 2019, TALG 2020] and runs in time and space ...
Lukasz Kowalik +4 more
openaire +8 more sources
TSP-12 and TSP-14 function redundantly to promote Sma/Mab signaling.
, 2017 TSP-12 and TSP-14 function redundantly to promote Sma/Mab signaling.
Zhiyu Liu (739871) +3 more
core +1 more source
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source