These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

115 related articles for article (PubMed ID: 31007325)

  • 1. The A Priori Traveling Repairman Problem.
    van Ee M; Sitters R
    Algorithmica; 2018; 80(10):2818-2833. PubMed ID: 31007325
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Characterization of the probabilistic traveling salesman problem.
    Bowler NE; Fink TM; Ball RC
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036703. PubMed ID: 14524922
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Circular Jaccard distance based multi-solution optimization for traveling salesman problems.
    Li H; Zhang M; Zeng C
    Math Biosci Eng; 2022 Mar; 19(5):4458-4480. PubMed ID: 35430823
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.
    Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S
    Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.
    Bao X; Wang G; Xu L; Wang Z
    Biomimetics (Basel); 2023 Jun; 8(2):. PubMed ID: 37366833
    [TBL] [Abstract][Full Text] [Related]  

  • 6. The ordered clustered travelling salesman problem: a hybrid genetic algorithm.
    Ahmed ZH
    ScientificWorldJournal; 2014; 2014():258207. PubMed ID: 24701148
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm.
    Ban HB; Pham DH
    PeerJ Comput Sci; 2023; 9():e1192. PubMed ID: 37346673
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On approximating a new generalization of traveling salesman problem.
    Huang Z; Liao X; Naik PA; Lu X
    Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Optimization of the time-dependent traveling salesman problem with Monte Carlo methods.
    Bentner J; Bauer G; Obermair GM; Morgenstern I; Schneider J
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Sep; 64(3 Pt 2):036701. PubMed ID: 11580476
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Exact and Approximate Stability of Solutions to Traveling Salesman Problems.
    Niendorf M; Girard AR
    IEEE Trans Cybern; 2018 Feb; 48(2):583-595. PubMed ID: 28103566
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Colored Traveling Salesman Problem.
    Li J; Zhou M; Sun Q; Dai X; Yu X
    IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem.
    Nayak A; Rathinam S
    Sensors (Basel); 2023 Jul; 23(14):. PubMed ID: 37514725
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Focusing on the golden ball metaheuristic: an extended study on a wider set of problems.
    Osaba E; Diaz F; Carballedo R; Onieva E; Perallos A
    ScientificWorldJournal; 2014; 2014():563259. PubMed ID: 25165742
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Solution for a bipartite Euclidean traveling-salesman problem in one dimension.
    Caracciolo S; Di Gioacchino A; Gherardi M; Malatesta EM
    Phys Rev E; 2018 May; 97(5-1):052109. PubMed ID: 29906886
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization.
    Akbari V; Sadati İ; Salman FS; Shiri D
    OR Spectr; 2023 Mar; ():1-46. PubMed ID: 37360932
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost.
    Bae J; Chung W
    Sensors (Basel); 2019 May; 19(11):. PubMed ID: 31146430
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Generating subtour elimination constraints for the TSP from pure integer solutions.
    Pferschy U; Staněk R
    Cent Eur J Oper Res; 2017; 25(1):231-260. PubMed ID: 28690424
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.
    Miao K; Duan H; Qian F; Dong Y
    PLoS One; 2019; 14(4):e0215107. PubMed ID: 30995233
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Exact solution of large asymmetric traveling salesman problems.
    Miller DL; Pekny JF
    Science; 1991 Feb; 251(4995):754-61. PubMed ID: 17775454
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An analogue approach to the travelling salesman problem using an elastic net method.
    Durbin R; Willshaw D
    Nature; 1987 Apr 16-22; 326(6114):689-91. PubMed ID: 3561510
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.