A Binary Bat Algorithm Applied to Knapsack Problem

[1]  Yung-Keun Kwon,et al.  A novel mutual information-based Boolean network inference method from time-series gene expression data , 2017, PloS one.

[2]  Saïd Hanafi,et al.  A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem , 2016, Eng. Appl. Artif. Intell..

[3]  Steven Li,et al.  Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm , 2015, Comput. Oper. Res..

[4]  Zhijing Yang,et al.  Binary artificial algae algorithm for multidimensional knapsack problems , 2016, Appl. Soft Comput..

[5]  Julián M. Ortiz,et al.  Urban Dynamic Estimation Using Mobile Phone Logs and Locally Varying Anisotropy , 2017 .

[6]  José García,et al.  A Percentile Transition Ranking Algorithm Applied to Binarization of Continuous Swarm Intelligence Metaheuristics , 2018, SCDM.

[7]  Eduardo Lalla-Ruiz,et al.  Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem , 2020, International Journal of Machine Learning and Cybernetics.

[8]  K. Teo,et al.  A Binary differential search algorithm for the 0-1 multidimensional knapsack problem , 2016 .

[9]  Broderick Crawford,et al.  A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems , 2019, Comput. Intell. Neurosci..

[10]  Broderick Crawford,et al.  A Meta-Optimization Approach to Solve the Set Covering Problem , 2018 .

[11]  Alvaro Peña,et al.  Robust Optimization: Concepts and Applications , 2018 .

[12]  José García,et al.  A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems , 2018, Complex..

[13]  Quan-Ke Pan,et al.  An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem , 2017, Appl. Soft Comput..

[14]  Broderick Crawford,et al.  A Percentile Transition Ranking Algorithm Applied to Knapsack Problem , 2017 .

[15]  José García,et al.  A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem , 2017, ICHSA.

[16]  José García,et al.  Putting Continuous Metaheuristics to Work in Binary Search Spaces , 2017, Complex..

[17]  Eduardo Graells-Garrido,et al.  Sensing Urban Patterns with Antenna Mappings: The Case of Santiago, Chile , 2016, Sensors.

[18]  José García,et al.  A clustering algorithm applied to the binarization of Swarm intelligence continuous metaheuristics , 2019, Swarm Evol. Comput..

[19]  M. Măntoiu,et al.  Localization results for zero order pseudodifferential operators , 2013, 1310.2663.

[20]  José García,et al.  A k-means binarization framework applied to multidimensional knapsack problem , 2018, Applied Intelligence.

[21]  José García,et al.  Constructive Metaheuristics for the Set Covering Problem , 2018, BIOMA.

[22]  Hasan Pirkul,et al.  A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .

[23]  José García,et al.  A Distributed K-Means Segmentation Algorithm Applied to Lobesia botrana Recognition , 2017, Complex..

[24]  José García,et al.  A Meta-Optimization Approach for Covering Problems in Facility Location , 2017, WEA.

[25]  Eduardo Graells-Garrido,et al.  Visual Exploration of Urban Dynamics Using Mobile Data , 2015, UCAmI.