Results 271 to 280 of about 62,282 (304)
Some of the next articles are maybe not open access.
Extended simulated annealing for augmented TSP and multi-salesmen TSP
Proceedings of the International Joint Conference on Neural Networks, 2003., 2004An extended simulated annealing (ESA), based on grand canonical ensemble (GCE), is proposed. An ESA is used to solve the augmented traveling salesman problems (ATSP) and the multiple traveling salesmen problems. Experimental results show that ESA has salient features such as simplicity and ability to find high-quality solutions as simulated annealing ...
Chi-Hwa Song, Kyunghee Lee, Won Don Lee
openaire +1 more source
Particle swarm optimization-based algorithms for TSP and generalized TSP
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shi, X.H. +4 more
openaire +1 more source
A Representation Model for TSP
2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013Traveling salesman problem (TSP) has been proven to be NP-complete and it is regarded for more than half a century. It is often represented as a weighted graph whereas the weighted graph cannot provide enough heuristic information for TSP. We do not know which edges belong to the best solution according to the edges' weights.
openaire +1 more source
2009
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed to modify its route only at the vertices. This limitation directly affects the capacity of the server to react and increases the risk related to each decision.
Mauro Aprea +3 more
openaire +1 more source
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed to modify its route only at the vertices. This limitation directly affects the capacity of the server to react and increases the risk related to each decision.
Mauro Aprea +3 more
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 PhysiologyThrombospondins (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 +7 more
openaire +2 more sources
On Approximating the TSP with Intersecting Neighborhoods
2006In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor approximation algorithm for intersecting convex fat ...
Khaled M. Elbassioni +2 more
openaire +4 more sources