Results 261 to 270 of about 62,282 (304)

Exploring the Influence of Testosterone on Pain Perception and Modulation Among Men with Low and Normal Testosterone Concentrations. [PDF]

J Pain Res
Vincenot M, Bordeleau M, le Blanc F, Pagé C, Gaumond I, Léonard G, Marchand S.   +6 more
europepmc   +1 more source

Co-delivery of synaptogenic and angiogenic nanoparticles in MAP scaffolds enhances post-stroke synapse formation.

J Mater Chem B
Phan NV, Thomas JL, Pasinsky A, Meadows Z, Li TT, Adams A, Zhu Y, Edgcomb A, Shi Y, Lyu S, Dunn TW, Segura T.   +11 more
europepmc   +1 more source

Zero-exchange transseptal access in atrial fibrillation ablation: Improving efficiency without compromising safety. [PDF]

Indian Pacing Electrophysiol J
Boddupalli SP, Gohil J.
europepmc   +1 more source

Protective Effects of a New Human Placental Extract Against Hair Graying and Chemotherapy-Induced Peripheral Neuropathy. [PDF]

Int J Mol Sci
Horio E, Katahira Y, Yamaguchi N, Igarashi M, Hasegawa H, Miyakawa S, Toda S, Mizoguchi I, Qu N, Anamizu H, Ikeda S, Matsumoto H, Yoshimoto T.   +12 more
europepmc   +1 more source

Interferon dynamics in deltaretroviruses: why HTLV-1 evades, but BLV responds. [PDF]

Mol Biol Rep
Akbarin MM, Farjami Z, Álvarez HR.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Deadline TSP

Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boaz Farbstein, Asaf Levin
openaire   +1 more source

Discounted Reward TSP

Algorithmica, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boaz Farbstein, Asaf Levin
openaire   +2 more sources

The Kth TSP is pseudopolynomial when TSP is polynomial

Discrete Mathematics, Algorithms and Applications, 2018
Given an undirected graph [Formula: see text] with a weight function [Formula: see text], and a positive integer [Formula: see text], the Kth Traveling Salesman Problem (Kth TSP) is to find [Formula: see text] Hamilton cycles [Formula: see text] such that, for any Hamilton cycle [Formula: see text], we have [Formula: see text]. This problem is NP-hard
openaire   +1 more source

An Evolutionary Approach for the TSP and the TSP with Backhauls

2010
This chapter presents an evolutionary approach for solving the traveling salesman problem (TSP) and the TSP with backhauls (TSPB). We propose two evolutionary algorithms for solving the difficult TSPs. Our focus is on developing evolutionary operators based on conventional heuristics.
Haldun Süral, Nur Evin Özdemirel, Ýlter Önder, Meltem Sönmez Turan   +3 more
openaire   +1 more source

An approximation algorithm for the TSP

Information Processing Letters, 1989
For a given complete weighted graph with n nodes, the authors present a heuristic algorithm with running time \(O(n^ 4)\) for the travelling salesman problem. Experimental studies show that the method gives better results in most cases than the well-known Quick method.
Josep M. Basart, Llorenç Huguet i Rotger   +1 more
openaire   +2 more sources