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 *

26 related articles for article (PubMed ID: 28103566)

  • 1. People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours.
    Acuña DE; Parada V
    PLoS One; 2010 Jul; 5(7):e11685. PubMed ID: 20686597
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the solution stability of parabolic optimal control problems.
    Corella AD; Jork N; Veliov VM
    Comput Optim Appl; 2023; 86(3):1035-1079. PubMed ID: 37969870
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network.
    Du Y; Fu S; Lu C; Zhou Q; Li C
    Comput Intell Neurosci; 2021; 2021():5590758. PubMed ID: 34122533
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Rough approximation models via graphs based on neighborhood systems.
    El Atik AEF; Nawar A; Atef M
    Granul Comput; 2021; 6(4):1025-1035. PubMed ID: 38624533
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Maximal rough neighborhoods with a medical application.
    Al-Shami TM
    J Ambient Intell Humaniz Comput; 2022 May; ():1-12. PubMed ID: 35529906
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Active design of diffuse acoustic fields in enclosures.
    Aquino W; Rouse J; Bonnet M
    J Acoust Soc Am; 2024 Feb; 155(2):1297-1307. PubMed ID: 38349806
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories.
    Li Y; Yin Z; Ma Y; Xu F; Yu H; Han G; Bi Y
    Sensors (Basel); 2022 May; 22(11):. PubMed ID: 35684773
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem.
    Cochrane EM; Beasley JE
    Neural Netw; 2003 Dec; 16(10):1499-525. PubMed ID: 14622879
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Mass transport in micellar surfactant solutions: 1. Relaxation of micelle concentration, aggregation number and polydispersity.
    Danov KD; Kralchevsky PA; Denkov ND; Ananthapadmanabhan KP; Lips A
    Adv Colloid Interface Sci; 2006 Jan; 119(1):1-16. PubMed ID: 16303116
    [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. Stability of Solutions to Classes of Traveling Salesman Problems.
    Niendorf M; Kabamba PT; Girard AR
    IEEE Trans Cybern; 2016 Apr; 46(4):973-85. PubMed ID: 25910270
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
    Al-Mulhem M; Al-Maghrabi T
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(4):618-20. PubMed ID: 18255981
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. Travelling Santa Problem: Optimization of a Million-Households Tour Within One Hour.
    Strutz T
    Front Robot AI; 2021; 8():652417. PubMed ID: 33912597
    [TBL] [Abstract][Full Text] [Related]  

  • 15.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

  • 16.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

  • 17.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

  • 18.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

  • 19.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

  • 20.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 2.