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 *

98 related articles for article (PubMed ID: 21052484)

  • 1. Evaluating the impact of AND/OR search on 0-1 integer linear programming.
    Marinescu R; Dechter R
    Constraints; 2010 Jan; 15(1):29-63. PubMed ID: 21052484
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions.
    de Andrade CE; Toso RF; Resende MG; Miyazawa FK
    Evol Comput; 2015; 23(2):279-307. PubMed ID: 25299242
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Automated discovery of local search heuristics for satisfiability testing.
    Fukunaga AS
    Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.
    Lyubetsky V; Gershgorin R; Gorbunov K
    BMC Bioinformatics; 2017 Dec; 18(1):537. PubMed ID: 29212445
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Applying aspiration in local search for satisfiability.
    Peng C; Xu Z; Mei M
    PLoS One; 2020; 15(4):e0231702. PubMed ID: 32324765
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.
    Ali AF; Tawhid MA
    Springerplus; 2016; 5():473. PubMed ID: 27217988
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems.
    Ortiz-Bayliss JC; Amaya I; Conant-Pablos SE; Terashima-Marín H
    Comput Intell Neurosci; 2018; 2018():6103726. PubMed ID: 29681923
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The checkpoint ordering problem.
    Hungerländer P
    Optimization; 2017 Oct; 66(10):1699-1712. PubMed ID: 29170574
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
    Ceberio J; Calvo B; Mendiburu A; Lozano JA
    Evol Comput; 2019; 27(2):291-311. PubMed ID: 29446983
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming.
    Schawe H; Bleim R; Hartmann AK
    PLoS One; 2019; 14(4):e0215309. PubMed ID: 31002678
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Solving linear integer programming problems by a novel neural model.
    Cavalieri S
    Int J Neural Syst; 1999 Feb; 9(1):27-39. PubMed ID: 10401928
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Solving and analyzing side-chain positioning problems using linear and integer programming.
    Kingsford CL; Chazelle B; Singh M
    Bioinformatics; 2005 Apr; 21(7):1028-36. PubMed ID: 15546935
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
    Moreno-Scott JH; Ortiz-Bayliss JC; Terashima-Marín H; Conant-Pablos SE
    Comput Intell Neurosci; 2016; 2016():7349070. PubMed ID: 26949383
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
    Chen X; Kong Y; Dang L; Hou Y; Ye X
    PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Mixed integer linear programming for maximum-parsimony phylogeny inference.
    Sridhar S; Lam F; Blelloch GE; Ravi R; Schwartz R
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(3):323-31. PubMed ID: 18670037
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. On a vector space representation in genetic algorithms for sensor scheduling in wireless sensor networks.
    Martins FV; Carrano EG; Wanner EF; Takahashi RH; Mateus GR; Nakamura FG
    Evol Comput; 2014; 22(3):361-403. PubMed ID: 24102647
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Seriation of asymmetric matrices using integer linear programming.
    Brusco MJ
    Br J Math Stat Psychol; 2001 Nov; 54(Pt 2):367-75. PubMed ID: 11817100
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Dynamic programming.
    Nalbantoğlu ÖU
    Methods Mol Biol; 2014; 1079():3-27. PubMed ID: 24170392
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.