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 *

116 related articles for article (PubMed ID: 38330021)

  • 1. A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem.
    Mortazavi A; Ghasri M; Ray T
    PLoS One; 2024; 19(2):e0292683. PubMed ID: 38330021
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem.
    Parragh SN
    Transp Res Part C Emerg Technol; 2011 Aug; 19(5):912-930. PubMed ID: 24511211
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem.
    Schilde M; Doerner KF; Hartl RF
    Eur J Oper Res; 2014 Oct; 238(1):18-30. PubMed ID: 25844013
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A deterministic annealing algorithm for approximating a solution of the max-bisection problem.
    Dang C; He L; Hui IK
    Neural Netw; 2002 Apr; 15(3):441-58. PubMed ID: 12125896
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Hybrid column generation and large neighborhood search for the dial-a-ride problem.
    Parragh SN; Schmid V
    Comput Oper Res; 2013 Jan; 40(1):490-497. PubMed ID: 23471127
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm.
    Dang C
    Neural Netw; 2000 Sep; 13(7):801-10. PubMed ID: 11152210
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem.
    Dang C; Liang J; Yang Y
    Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports.
    Schilde M; Doerner KF; Hartl RF
    Comput Oper Res; 2011 Dec; 38(12):1719-1730. PubMed ID: 23543641
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Variable Neighborhood Search for Multi-Cycle Medical Waste Recycling Vehicle Routing Problem with Time Windows.
    Zhang W; Zeng M; Guo P; Wen K
    Int J Environ Res Public Health; 2022 Oct; 19(19):. PubMed ID: 36232188
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.
    Ezugwu AE; Akutsah F; Olusanya MO; Adewumi AO
    PLoS One; 2018; 13(3):e0193751. PubMed ID: 29554662
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Optimization of Vehicle Routing for Waste Collection and Transportation.
    Wu H; Tao F; Yang B
    Int J Environ Res Public Health; 2020 Jul; 17(14):. PubMed ID: 32660117
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem.
    Lusby RM; Schwierz M; Range TM; Larsen J
    Artif Intell Med; 2016 Nov; 74():21-31. PubMed ID: 27964800
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Robot path planning based on artificial potential field with deterministic annealing.
    Wu Z; Dai J; Jiang B; Karimi HR
    ISA Trans; 2023 Jul; 138():74-87. PubMed ID: 36822875
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.
    Deb K; Sinha A
    Evol Comput; 2010; 18(3):403-49. PubMed ID: 20560758
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Improved slime mould algorithm based on hybrid strategy optimization of Cauchy mutation and simulated annealing.
    Zhang X; Liu Q; Bai X
    PLoS One; 2023; 18(1):e0280512. PubMed ID: 36696386
    [TBL] [Abstract][Full Text] [Related]  

  • 17. SONG: A Multi-Objective Evolutionary Algorithm for Delay and Energy Aware Facility Location in Vehicular Fog Networks.
    Hussain MM; Azar AT; Ahmed R; Umar Amin S; Qureshi B; Dinesh Reddy V; Alam I; Khan ZI
    Sensors (Basel); 2023 Jan; 23(2):. PubMed ID: 36679463
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A Tandem Robotic Arm Inverse Kinematic Solution Based on an Improved Particle Swarm Algorithm.
    Zhao G; Jiang D; Liu X; Tong X; Sun Y; Tao B; Kong J; Yun J; Liu Y; Fang Z
    Front Bioeng Biotechnol; 2022; 10():832829. PubMed ID: 35662837
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem.
    Ngo TS; Jaafar J; Aziz IA; Aftab MU; Nguyen HG; Bui NA
    Entropy (Basel); 2022 Mar; 24(3):. PubMed ID: 35327899
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Routing in waste collection: A simulated annealing algorithm for an Argentinean case study.
    Rossit DG; Toncovich AA; Fermani M
    Math Biosci Eng; 2021 Nov; 18(6):9579-9605. PubMed ID: 34814359
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.