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 *

114 related articles for article (PubMed ID: 38837918)

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

  • 2. A Random Forest-Assisted Evolutionary Algorithm for Data-Driven Constrained Multiobjective Combinatorial Optimization of Trauma Systems.
    Wang H; Jin Y
    IEEE Trans Cybern; 2020 Feb; 50(2):536-549. PubMed ID: 30273180
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Multiple Choice Knapsack Problem: example of planning choice in transportation.
    Zhong T; Young R
    Eval Program Plann; 2010 May; 33(2):128-37. PubMed ID: 19596437
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Synthesising Diverse and Discriminatory Sets of Instances using Novelty Search in Combinatorial Domains.
    Marrero A; Segredo E; León C; Hart E
    Evol Comput; 2024 May; ():1-41. PubMed ID: 38713741
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Helper and Equivalent Objectives: Efficient Approach for Constrained Optimization.
    Xu T; He J; Shang C
    IEEE Trans Cybern; 2022 Jan; 52(1):240-251. PubMed ID: 32224478
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
    Lu Z; Zhou Y; Hao JK
    IEEE Trans Cybern; 2022 Sep; 52(9):9391-9403. PubMed ID: 33635807
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 12. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.
    Zhang Y; Wang S; Liu C; Zhu E
    Sensors (Basel); 2023 Sep; 23(18):. PubMed ID: 37765887
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms.
    Wang J; Zhou Y; Wang Y; Zhang J; Chen CL; Zheng Z
    IEEE Trans Cybern; 2016 Mar; 46(3):582-94. PubMed ID: 25794408
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Dynamic vehicle routing with time windows in theory and practice.
    Yang Z; van Osta JP; van Veen B; van Krevelen R; van Klaveren R; Stam A; Kok J; Bäck T; Emmerich M
    Nat Comput; 2017; 16(1):119-134. PubMed ID: 28255293
    [TBL] [Abstract][Full Text] [Related]  

  • 15. High-dimensional Cost-constrained Regression via Nonconvex Optimization.
    Yu G; Fu H; Liu Y
    Technometrics; 2022; 64(1):52-64. PubMed ID: 36312889
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Optimization Algorithms for Joint Power and Sub-Channel Allocation for NOMA-Based Maritime Communications.
    Li H; Li H; Zhou Y
    Entropy (Basel); 2021 Nov; 23(11):. PubMed ID: 34828152
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Chemical reaction optimization for solving shortest common supersequence problem.
    Khaled Saifullah CM; Rafiqul Islam M
    Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Controller optimization using data-driven constrained bat algorithm with gradient-based depth-first search strategy.
    Li H; Song B; Tang X; Xie Y; Zhou X
    ISA Trans; 2022 Jun; 125():212-236. PubMed ID: 34243945
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.