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 *

127 related articles for article (PubMed ID: 34720295)

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

  • 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. Scheduling in the Random-Order Model.
    Albers S; Janke M
    Algorithmica; 2021; 83(9):2803-2832. PubMed ID: 34720298
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Best Fit Bin Packing with Random Order Revisited.
    Albers S; Khan A; Ladewig L
    Algorithmica; 2021; 83(9):2833-2858. PubMed ID: 34776569
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. A novel approach for solving travelling thief problem using enhanced simulated annealing.
    Ali H; Zaid Rafique M; Shahzad Sarfraz M; Malik MSA; Alqahtani MA; Alqurni JS
    PeerJ Comput Sci; 2021; 7():e377. PubMed ID: 33834093
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 12. Combinatorial efficiency evaluation: the knapsack problem in data envelopment analysis.
    Qi XG; Guo B
    ScientificWorldJournal; 2014; 2014():789053. PubMed ID: 25114971
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem.
    Li Z; Tang L; Liu J
    IEEE Trans Cybern; 2022 Apr; 52(4):2284-2299. PubMed ID: 32673199
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0-1 knapsack problems.
    Feng Y; Wang GG; Feng Q; Zhao XJ
    Comput Intell Neurosci; 2014; 2014():857254. PubMed ID: 25404940
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search.
    Huang X; Zeng X; Han R
    Comput Intell Neurosci; 2017; 2017():3235720. PubMed ID: 28634487
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multi-objective database queries in combined knapsack and set covering problem domains.
    Mochocki SA; Lamont GB; Leishman RC; Kauffman KJ
    J Big Data; 2021; 8(1):46. PubMed ID: 33723497
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Landscape Analysis of a Class of NP-Hard Binary Packing Problems.
    Alyahya K; Rowe JE
    Evol Comput; 2019; 27(1):47-73. PubMed ID: 30365387
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications.
    Li X; Liu S; Wang J; Chen X; Ong YS; Tang K
    IEEE Trans Cybern; 2024 Jun; PP():. PubMed ID: 38837918
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 7.