286 related articles for article (PubMed ID: 29584729)
1. Exact and heuristic algorithms for Space Information Flow.
Uwitonze A; Huang J; Ye Y; Cheng W; Li Z
PLoS One; 2018; 13(3):e0193350. PubMed ID: 29584729
[TBL] [Abstract][Full Text] [Related]
2. Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.
Uwitonze A; Huang J; Ye Y; Cheng W
Sensors (Basel); 2017 Apr; 17(4):. PubMed ID: 28425923
[TBL] [Abstract][Full Text] [Related]
3. Fitting a geometric graph to a protein-protein interaction network.
Higham DJ; Rasajski M; Przulj N
Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
[TBL] [Abstract][Full Text] [Related]
4. Microcanonical optimization algorithm for the Euclidean Steiner problem in Rn with application to phylogenetic inference.
Montenegro F; Torreão JR; Maculan N
Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Nov; 68(5 Pt 2):056702. PubMed ID: 14682906
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Evolutionary algorithm based heuristic scheme for nonlinear heat transfer equations.
Ullah A; Malik SA; Alimgeer KS
PLoS One; 2018; 13(1):e0191103. PubMed ID: 29351304
[TBL] [Abstract][Full Text] [Related]
7. Algorithms for multiple genome rearrangement by signed reversals.
Wu S; Gu X
Pac Symp Biocomput; 2003; ():363-74. PubMed ID: 12603042
[TBL] [Abstract][Full Text] [Related]
8. An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length.
Shin D; Choi S
PLoS One; 2023; 18(11):e0294353. PubMed ID: 37988376
[TBL] [Abstract][Full Text] [Related]
9. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
Lai X; Zhou Y; Xia X; Zhang Q
Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
[TBL] [Abstract][Full Text] [Related]
10. Better ILP models for haplotype assembly.
Etemadi M; Bagherian M; Chen ZZ; Wang L
BMC Bioinformatics; 2018 Feb; 19(Suppl 1):52. PubMed ID: 29504891
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Enhanced meta-heuristic optimization of resource efficiency in multi-relay underground wireless sensor networks.
Ayedi M
PeerJ Comput Sci; 2023; 9():e1357. PubMed ID: 37346654
[TBL] [Abstract][Full Text] [Related]
13. A multiobjective optimization model and an orthogonal design-based hybrid heuristic algorithm for regional urban mining management problems.
Wu H; Wan Z
J Air Waste Manag Assoc; 2018 Feb; 68(2):146-169. PubMed ID: 29035632
[TBL] [Abstract][Full Text] [Related]
14. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
Fujita M; Shimada Y; Kimura T; Ikeguchi T
PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
[TBL] [Abstract][Full Text] [Related]
15. An Improved Migratory Birds Optimization Algorithm for Closed- Loop Supply Chain Network Planning in a Fuzzy Environment.
Ren Y; Chen Q; Lau YY; Dulebenets MA; Li M; Li B; Ching-Pong Poo M; Zhang P
PLoS One; 2024; 19(6):e0306294. PubMed ID: 38935787
[TBL] [Abstract][Full Text] [Related]
16. Reconstruction of ancestral genomic sequences using likelihood.
Elias I; Tuller T
J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
[TBL] [Abstract][Full Text] [Related]
17. Overlapping communities detection through weighted graph community games.
Benati S; Puerto J; Rodríguez-Chía AM; Temprano F
PLoS One; 2023; 18(4):e0283857. PubMed ID: 37014883
[TBL] [Abstract][Full Text] [Related]
18. Hyper-heuristics with low level parameter adaptation.
Ren Z; Jiang H; Xuan J; Luo Z
Evol Comput; 2012; 20(2):189-227. PubMed ID: 22171917
[TBL] [Abstract][Full Text] [Related]
19. A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.
Chen H; Li L; Ren J; Wang Y; Zhao Y; Wang X; Wang S; Xu S
PLoS One; 2015; 10(12):e0145437. PubMed ID: 26690571
[TBL] [Abstract][Full Text] [Related]
20. Finding maximum colorful subtrees in practice.
Rauf I; Rasche F; Nicolas F; Böcker S
J Comput Biol; 2013 Apr; 20(4):311-21. PubMed ID: 23509858
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
