186 related articles for article (PubMed ID: 26388997)
1. An Optimization-Driven Analysis Pipeline to Uncover Biomarkers and Signaling Paths: Cervix Cancer.
Lorenzo E; Camacho-Caceres K; Ropelewski AJ; Rosas J; Ortiz-Mojer M; Perez-Marty L; Irizarry J; Gonzalez V; Rodríguez JA; Cabrera-Rios M; Isaza C
Microarrays (Basel); 2015 Jun; 4(2):287-310. PubMed ID: 26388997
[TBL] [Abstract][Full Text] [Related]
2. Biological signaling pathways and potential mathematical network representations: biological discovery through optimization.
Isaza C; Rosas JF; Lorenzo E; Marrero A; Ortiz C; Ortiz MR; Perez L; Cabrera-Ríos M
Cancer Med; 2018 May; 7(5):1875-1895. PubMed ID: 29635835
[TBL] [Abstract][Full Text] [Related]
3. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.
Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S
Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364
[TBL] [Abstract][Full Text] [Related]
4. Colored Traveling Salesman Problem.
Li J; Zhou M; Sun Q; Dai X; Yu X
IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
[TBL] [Abstract][Full Text] [Related]
5. TAPS: A traveling-salesman based automated path searching method for functional conformational changes of biological macromolecules.
Zhu L; Sheong FK; Cao S; Liu S; Unarta IC; Huang X
J Chem Phys; 2019 Mar; 150(12):124105. PubMed ID: 30927873
[TBL] [Abstract][Full Text] [Related]
6. Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.
Zhang Z; Gao C; Lu Y; Liu Y; Liang M
PLoS One; 2016; 11(1):e0146709. PubMed ID: 26751562
[TBL] [Abstract][Full Text] [Related]
7. Systems biology of cancer biomarker detection.
Mitra S; Das S; Chakrabarti J
Cancer Biomark; 2013; 13(4):201-13. PubMed ID: 24240581
[TBL] [Abstract][Full Text] [Related]
8. A neural-network-based approach to the double traveling salesman problem.
Plebe A; Anile AM
Neural Comput; 2002 Feb; 14(2):437-71. PubMed ID: 11802920
[TBL] [Abstract][Full Text] [Related]
9. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
Dahan F; El Hindi K; Mathkour H; AlSalman H
Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
[TBL] [Abstract][Full Text] [Related]
10. Traveling salesman problem with a center.
Lipowski A; Lipowska D
Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):067701. PubMed ID: 16089923
[TBL] [Abstract][Full Text] [Related]
11. Solving a four-destination traveling salesman problem using Escherichia coli cells as biocomputers.
Esau M; Rozema M; Zhang TH; Zeng D; Chiu S; Kwan R; Moorhouse C; Murray C; Tseng NT; Ridgway D; Sauvageau D; Ellison M
ACS Synth Biol; 2014 Dec; 3(12):972-5. PubMed ID: 25524102
[TBL] [Abstract][Full Text] [Related]
12. Self-organization and solution of shortest-path optimization problems with memristive networks.
Pershin YV; Di Ventra M
Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jul; 88(1):013305. PubMed ID: 23944581
[TBL] [Abstract][Full Text] [Related]
13. A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.
Aras N; Altinel IK; Oommen J
IEEE Trans Neural Netw; 2003; 14(4):869-90. PubMed ID: 18238067
[TBL] [Abstract][Full Text] [Related]
14. Fast marching methods for the continuous traveling salesman problem.
Andrews J; Sethian JA
Proc Natl Acad Sci U S A; 2007 Jan; 104(4):1118-23. PubMed ID: 17220271
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Human performance on the traveling salesman problem.
MacGregor JN; Ormerod T
Percept Psychophys; 1996 May; 58(4):527-39. PubMed ID: 8934685
[TBL] [Abstract][Full Text] [Related]
17. A traveling salesman approach for predicting protein functions.
Johnson O; Liu J
Source Code Biol Med; 2006 Oct; 1():3. PubMed ID: 17147783
[TBL] [Abstract][Full Text] [Related]
18. Optimization of the time-dependent traveling salesman problem with Monte Carlo methods.
Bentner J; Bauer G; Obermair GM; Morgenstern I; Schneider J
Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Sep; 64(3 Pt 2):036701. PubMed ID: 11580476
[TBL] [Abstract][Full Text] [Related]
19. Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.
Osaba E
Data Brief; 2020 Apr; 29():105142. PubMed ID: 32055657
[TBL] [Abstract][Full Text] [Related]
20. TU-G-BRB-01: Continuous Path Optimization for Non-Coplanar Variant SAD IMRT Delivery Using C-Arm Machines.
Ruan D; Dong P; Low D; Sheng K
Med Phys; 2012 Jun; 39(6Part24):3919. PubMed ID: 28518680
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
