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 *

118 related articles for article (PubMed ID: 38755943)

  • 1. Large-W limit of the knapsack problem.
    Williams M
    Phys Rev E; 2024 Apr; 109(4-1):044151. PubMed ID: 38755943
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Binary salp swarm algorithm for discounted {0-1} knapsack problem.
    Dang BT; Truong TK
    PLoS One; 2022; 17(4):e0266537. PubMed ID: 35390109
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An efficient optimizer for the 0/1 knapsack problem using group counseling.
    Ghadi YY; AlShloul T; Nezami ZI; Ali H; Asif M; Aljuaid H; Ahmad S
    PeerJ Comput Sci; 2023; 9():e1315. PubMed ID: 37346609
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Exact solution of the robust knapsack problem.
    Monaci M; Pferschy U; Serafini P
    Comput Oper Res; 2013 Nov; 40(11):2625-2631. PubMed ID: 24187428
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.
    Wang Z; Zhang H; Li Y
    Comput Intell Neurosci; 2022; 2022():1266529. PubMed ID: 36317076
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems.
    Feng Y; Jia K; He Y
    Comput Intell Neurosci; 2014; 2014():970456. PubMed ID: 24527026
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Systematic Approach for Computing Zero-Point Energy, Quantum Partition Function, and Tunneling Effect Based on Kleinert's Variational Perturbation Theory.
    Wong KY; Gao J
    J Chem Theory Comput; 2008 Sep; 4(9):1409-1422. PubMed ID: 19749977
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fast computation of exact solutions of generic and degenerate assignment problems.
    Koehl P; Orland H
    Phys Rev E; 2021 Apr; 103(4-1):042101. PubMed ID: 34005932
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Optimized packing multidimensional hyperspheres: a unified approach.
    Stoyan Y; Yaskov G; Romanova T; Litvinchev I; Yakovlev S; Velarde Cantú JM
    Math Biosci Eng; 2020 Sep; 17(6):6601-6630. PubMed ID: 33378868
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On local search for bi-objective knapsack problems.
    Liefooghe A; Paquete L; Figueira JR
    Evol Comput; 2013; 21(1):179-96. PubMed ID: 22385108
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems.
    Wu H; Xiao R
    Research (Wash D C); 2020; 2020():1762107. PubMed ID: 32159160
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.
    Olivas F; Amaya I; Ortiz-Bayliss JC; Conant-Pablos SE; Terashima-Marín H
    Comput Intell Neurosci; 2021; 2021():8834324. PubMed ID: 33564300
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. The k partition-distance problem.
    Chen YH
    J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On complexity of optimal recombination for binary representations of solutions.
    Eremeev AV
    Evol Comput; 2008; 16(1):127-47. PubMed ID: 18386998
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Flexible supplier selection and order allocation in the big data era with various quantity discounts.
    Wang Q
    PLoS One; 2023; 18(3):e0283585. PubMed ID: 36972272
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An Adaptive Optimization Spiking Neural P System for Binary Problems.
    Zhu M; Yang Q; Dong J; Zhang G; Gou X; Rong H; Paul P; Neri F
    Int J Neural Syst; 2021 Jan; 31(1):2050054. PubMed ID: 32938261
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
    Albers S; Khan A; Ladewig L
    Algorithmica; 2021; 83(6):1750-1785. PubMed ID: 34720295
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Constrained portfolio optimization with discrete variables: An algorithmic method based on dynamic programming.
    Jezeie FV; Sadjadi SJ; Makui A
    PLoS One; 2022; 17(7):e0271811. PubMed ID: 35901177
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.