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 *

113 related articles for article (PubMed ID: 37310276)

  • 1. Approaching the Traveling Tournament Problem with Randomized Beam Search.
    Frohner N; Neumann B; Pace G; Raidl GR
    Evol Comput; 2023 Sep; 31(3):233-257. PubMed ID: 37310276
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. Waste collection routing problem: A mini-review of recent heuristic approaches and applications.
    Liang YC; Minanda V; Gunawan A
    Waste Manag Res; 2022 May; 40(5):519-537. PubMed ID: 33764243
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Learning Improvement Heuristics for Solving Routing Problems.
    Wu Y; Song W; Cao Z; Zhang J; Lim A
    IEEE Trans Neural Netw Learn Syst; 2022 Sep; 33(9):5057-5069. PubMed ID: 33793405
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
    Nallaperuma S; Neumann F; Sudholt D
    Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Lower and upper bounds for the two-echelon capacitated location-routing problem.
    Contardo C; Hemmelmayr V; Crainic TG
    Comput Oper Res; 2012 Dec; 39(12):3185-3199. PubMed ID: 24511176
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.
    Jiang ZB; Yang Q
    PLoS One; 2016; 11(11):e0165804. PubMed ID: 27812175
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A set-covering based heuristic algorithm for the periodic vehicle routing problem.
    Cacchiani V; Hemmelmayr VC; Tricoire F
    Discrete Appl Math; 2014 Jan; 163(Pt 1):53-64. PubMed ID: 24748696
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems.
    MacLachlan J; Mei Y; Branke J; Zhang M
    Evol Comput; 2020; 28(4):563-593. PubMed ID: 31730372
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
    Chen X; Kong Y; Dang L; Hou Y; Ye X
    PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Solving large break minimization problems in a mirrored double round-robin tournament using quantum annealing.
    Kuramata M; Katsuki R; Nakata K
    PLoS One; 2022; 17(4):e0266846. PubMed ID: 35395057
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A Predictive-Reactive Approach with Genetic Programming and Cooperative Coevolution for the Uncertain Capacitated Arc Routing Problem.
    Liu Y; Mei Y; Zhang M; Zhang Z
    Evol Comput; 2020; 28(2):289-316. PubMed ID: 31012736
    [TBL] [Abstract][Full Text] [Related]  

  • 16. HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem.
    Liu Y; Guo P; Zeng Y
    Comput Intell Neurosci; 2022; 2022():6400318. PubMed ID: 35096045
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem.
    Zhang J; Liu Q; Han X
    PLoS One; 2023; 18(3):e0283207. PubMed ID: 36943840
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.
    Dalbah LM; Al-Betar MA; Awadallah MA; Zitar RA
    J King Saud Univ Comput Inf Sci; 2022 Sep; 34(8):4782-4795. PubMed ID: 37520767
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A Route Clustering and Search Heuristic for Large-Scale Multidepot-Capacitated Arc Routing Problem.
    Zhang Y; Mei Y; Huang S; Zheng X; Zhang C
    IEEE Trans Cybern; 2022 Aug; 52(8):8286-8299. PubMed ID: 33531309
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems.
    Muñoz-Herrera S; Suchan K
    Entropy (Basel); 2021 Dec; 24(1):. PubMed ID: 35052079
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.