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 *

109 related articles for article (PubMed ID: 36173817)

  • 1. Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier Space.
    Elorza A; Hernando L; Lozano JA
    Evol Comput; 2023 Sep; 31(3):163-199. PubMed ID: 36173817
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.
    Yu X; Chen WN; Gu T; Zhang H; Yuan H; Kwong S; Zhang J
    IEEE Trans Cybern; 2018 Jul; 48(7):2139-2153. PubMed ID: 28792909
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Memory-efficient Transformer-based network model for Traveling Salesman Problem.
    Yang H; Zhao M; Yuan L; Yu Y; Li Z; Gu M
    Neural Netw; 2023 Apr; 161():589-597. PubMed ID: 36822144
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
    Nallaperuma S; Neumann F; Sudholt D
    Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.
    Jiang ZB; Yang Q
    PLoS One; 2016; 11(11):e0165804. PubMed ID: 27812175
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation.
    Gog S; Bader M
    J Comput Biol; 2008 Oct; 15(8):1029-41. PubMed ID: 18781831
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The Collaborative Local Search Based on Dynamic-Constrained Decomposition With Grids for Combinatorial Multiobjective Optimization.
    Cai X; Xia C; Zhang Q; Mei Z; Hu H; Wang L; Hu J
    IEEE Trans Cybern; 2021 May; 51(5):2639-2650. PubMed ID: 31425134
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Solving the Traveling Salesman's Problem Using the African Buffalo Optimization.
    Odili JB; Mohmad Kahar MN
    Comput Intell Neurosci; 2016; 2016():1510256. PubMed ID: 26880872
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Approaching the Traveling Tournament Problem with Randomized Beam Search.
    Frohner N; Neumann B; Pace G; Raidl GR
    Evol Comput; 2023 Sep; 31(3):233-257. PubMed ID: 37310276
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Macromolecular crowding: chemistry and physics meet biology (Ascona, Switzerland, 10-14 June 2012).
    Foffi G; Pastore A; Piazza F; Temussi PA
    Phys Biol; 2013 Aug; 10(4):040301. PubMed ID: 23912807
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A methodology to find the elementary landscape decomposition of combinatorial optimization problems.
    Chicano F; Whitley LD; Alba E
    Evol Comput; 2011; 19(4):597-637. PubMed ID: 21469972
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. An evaluation of methods for estimating the number of local optima in combinatorial optimization problems.
    Hernando L; Mendiburu A; Lozano JA
    Evol Comput; 2013; 21(4):625-58. PubMed ID: 23270389
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the suitability of different representations of solid catalysts for combinatorial library design by genetic algorithms.
    Gobin OC; Schüth F
    J Comb Chem; 2008; 10(6):835-46. PubMed ID: 18693763
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes.
    Daolio F; Liefooghe A; Verel S; Aguirre H; Tanaka K
    Evol Comput; 2017; 25(4):555-585. PubMed ID: 27689467
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Anatomy of the Attraction Basins: Breaking with the Intuition.
    Hernando L; Mendiburu A; Lozano JA
    Evol Comput; 2019; 27(3):435-466. PubMed ID: 29786459
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Lambda-opt neural approaches to quadratic assignment problems.
    Ishii S; Niitsuma H
    Neural Comput; 2000 Sep; 12(9):2209-25. PubMed ID: 10976144
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Characterizing the combinatorial beam angle selection problem.
    Bangert M; Ziegenhein P; Oelfke U
    Phys Med Biol; 2012 Oct; 57(20):6707-23. PubMed ID: 23023092
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.