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: 35855459)

  • 1. Robust min-max regret covering problems.
    Coco AA; Santos AC; Noronha TF
    Comput Optim Appl; 2022; 83(1):111-141. PubMed ID: 35855459
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.
    Ćwik M; Józefczyk J
    Cent Eur J Oper Res; 2018; 26(1):215-238. PubMed ID: 29375268
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem.
    Parragh SN; Tricoire F; Gutjahr WJ
    OR Spectr; 2022; 44(2):419-459. PubMed ID: 35673526
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Exact solution approaches for the discrete
    Gaar E; Sinnl M
    Networks (N Y); 2023 Dec; 82(4):371-399. PubMed ID: 38529259
    [TBL] [Abstract][Full Text] [Related]  

  • 5. The minimum regret path problem on stochastic fuzzy time-varying networks.
    Huang W; Xu Z; Zhu L
    Neural Netw; 2022 Sep; 153():450-460. PubMed ID: 35816858
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An Integrated Method Based on PSO and EDA for the Max-Cut Problem.
    Lin G; Guan J
    Comput Intell Neurosci; 2016; 2016():3420671. PubMed ID: 26989404
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.
    Laesanklang W; Landa-Silva D
    Ann Oper Res; 2017; 256(1):93-127. PubMed ID: 31258236
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Time-constrained maximal covering routing problem.
    Amiri A; Salari M
    OR Spectr; 2019; 41(2):415-468. PubMed ID: 32214572
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Decomposition Algorithms for a Multi-Hard Problem.
    Przybylek MR; Wierzbicki A; Michalewicz Z
    Evol Comput; 2018; 26(3):507-533. PubMed ID: 28632397
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Interval fuzzy modeling applied to Wiener models with uncertainties.
    Skrjanc I; Blazic S; Agamennoni OE
    IEEE Trans Syst Man Cybern B Cybern; 2005 Oct; 35(5):1092-5. PubMed ID: 16240782
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.
    Madni SHH; Abd Latiff MS; Abdullahi M; Abdulhamid SM; Usman MJ
    PLoS One; 2017; 12(5):e0176321. PubMed ID: 28467505
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Minimality and comparison of sets of multi-attribute vectors.
    Toffano F; Wilson N
    Auton Agent Multi Agent Syst; 2022; 36(2):44. PubMed ID: 35978912
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Exact and heuristic algorithms for Space Information Flow.
    Uwitonze A; Huang J; Ye Y; Cheng W; Li Z
    PLoS One; 2018; 13(3):e0193350. PubMed ID: 29584729
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Flow Decomposition With Subpath Constraints.
    Williams L; Tomescu AI; Mumey B
    IEEE/ACM Trans Comput Biol Bioinform; 2023; 20(1):360-370. PubMed ID: 35104222
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.
    Sabar NR; Ayob M; Kendall G; Qu R
    IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Decomposition methods for the two-stage stochastic Steiner tree problem.
    Leitner M; Ljubić I; Luipersbeck M; Sinnl M
    Comput Optim Appl; 2018; 69(3):713-752. PubMed ID: 31258249
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.