Results 241 to 250 of about 77,620 (283)

Macrophage inhibitory cytokine 1, syncollin and thrombospondin-2 in pancreatic ductal adenocarcinoma and chronic pancreatitis differentiation. [PDF]

Front Oncol
Wieczorek M, Wieczorek L, Borkowska A, Malecka-Wojciesko E.   +3 more
europepmc   +1 more source

Pre-operative circulating tumour DNA in high-risk primary cutaneous melanoma: prospective feasibility in molecular pathology. [PDF]

Acta Oncol
Obinah MPB, Høgdall E, Poulsen TS, Dreisig K, Litman T, Johansen C, Bojesen SE, Hölmich LR.   +7 more
europepmc   +1 more source

Hospital-Based Food Challenges for the Diagnosis of Food Allergy-A BSACI Clinical Practice Statement. [PDF]

Clin Exp Allergy
Skypala IJ, Ball HB, Gore C, Sooriyakumar K, Stevens D, Patil V, Elghoudi A, Dempsey J, Blamires S, Wright K, Stoenchev K, Doyle M, Gunawardana N, Siew L, Knibb R, Edmonds J, Patel N.   +16 more
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   +2 more sources

TSP with bounded metrics

Journal of Computer and System Sciences, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Karpinski
exaly   +2 more sources

Discounted Reward TSP

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

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

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 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   +3 more sources

Discrete online TSP

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, Esteban Feuerstein, Gustavo Sadovoy, Alejandro Strejilevich de Loma   +3 more
openaire   +1 more source