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 *

123 related articles for article (PubMed ID: 32251428)

  • 1. Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem.
    Cid-Garcia NM; Rios-Solis YA
    PLoS One; 2020; 15(4):e0229358. PubMed ID: 32251428
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology.
    Cid-Garcia NM; Rios-Solis YA
    PLoS One; 2021; 16(1):e0245267. PubMed ID: 33444394
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Covering, corner-searching and occupying: A three-stage intelligent algorithm for the 2d multishape part packing problem.
    Ren H; Zhong R
    PLoS One; 2022; 17(5):e0268514. PubMed ID: 35639732
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Automating the packing heuristic design process with genetic programming.
    Burke EK; Hyde MR; Kendall G; Woodward J
    Evol Comput; 2012; 20(1):63-89. PubMed ID: 21609273
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A polynomial time solvable formulation of multiple sequence alignment.
    Sze SH; Lu Y; Yang Q
    J Comput Biol; 2006 Mar; 13(2):309-19. PubMed ID: 16597242
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A lifelong learning hyper-heuristic method for bin packing.
    Sim K; Hart E; Paechter B
    Evol Comput; 2015; 23(1):37-67. PubMed ID: 24512321
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system.
    Yang J; Liang K; Liu H; Shan M; Zhou L; Kong L; Li X
    PeerJ Comput Sci; 2023; 9():e1613. PubMed ID: 37869457
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Hybrid approach for solving real-world bin packing problem instances using quantum annealers.
    V Romero S; Osaba E; Villar-Rodriguez E; Oregi I; Ban Y
    Sci Rep; 2023 Jul; 13(1):11777. PubMed ID: 37479874
    [TBL] [Abstract][Full Text] [Related]  

  • 9. QAL-BP: an augmented Lagrangian quantum approach for bin packing.
    Cellini L; Macaluso A; Lombardi M
    Sci Rep; 2024 Mar; 14(1):5142. PubMed ID: 38429296
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A GAN-based genetic algorithm for solving the 3D bin packing problem.
    Zhang B; Yao Y; Kan HK; Luo W
    Sci Rep; 2024 Apr; 14(1):7775. PubMed ID: 38565555
    [TBL] [Abstract][Full Text] [Related]  

  • 11. An effective exact algorithm and a new upper bound for the number of contacts in the hydrophobic-polar two-dimensional lattice model.
    Giaquinta E; Pozzi L
    J Comput Biol; 2013 Aug; 20(8):593-609. PubMed ID: 23899013
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Optimal shortening of uniform covering arrays.
    Torres-Jimenez J; Rangel-Valdez N; Avila-George H; Carrizalez-Turrubiates O
    PLoS One; 2017; 12(12):e0189283. PubMed ID: 29267343
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A deep reinforcement learning algorithm for the rectangular strip packing problem.
    Fang J; Rao Y; Shi M
    PLoS One; 2023; 18(3):e0282598. PubMed ID: 36928505
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the approximation of optimal structures for RNA-RNA interaction.
    Mneimneh S
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):682-8. PubMed ID: 19875865
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Brain-Inspired Experience Reinforcement Model for Bin Packing in Varying Environments.
    Zhang L; Li D; Jia S; Shao H
    IEEE Trans Neural Netw Learn Syst; 2022 May; 33(5):2168-2180. PubMed ID: 35104230
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.
    Pourhassan M; Neumann F
    Evol Comput; 2019; 27(3):525-558. PubMed ID: 29932364
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.