Solving 0–1 knapsack problem by binary flower pollination algorithm
Published 2018 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Solving 0–1 knapsack problem by binary flower pollination algorithm
Authors
Keywords
-
Journal
NEURAL COMPUTING & APPLICATIONS
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-02-28
DOI
10.1007/s00521-018-3375-7
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A complex-valued encoding wind driven optimization for the 0-1 knapsack problem
- (2016) Yongquan Zhou et al. APPLIED INTELLIGENCE
- Solving 0-1 knapsack problem by greedy degree and expectation efficiency
- (2016) Jianhui Lv et al. APPLIED SOFT COMPUTING
- An improved monkey algorithm for a 0-1 knapsack problem
- (2016) Yongquan Zhou et al. APPLIED SOFT COMPUTING
- An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
- (2016) Eneko Osaba et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm
- (2016) Ting Yee Lim et al. EXPERT SYSTEMS WITH APPLICATIONS
- Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation
- (2016) Yanhong Feng et al. Memetic Computing
- A new monarch butterfly optimization with an improved crossover operator
- (2016) Gai-Ge Wang et al. Operational Research
- A simplified binary harmony search algorithm for large scale 0–1 knapsack problems
- (2015) Xiangyong Kong et al. EXPERT SYSTEMS WITH APPLICATIONS
- Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization
- (2015) Yanhong Feng et al. NEURAL COMPUTING & APPLICATIONS
- A Complex-valued Encoding Bat Algorithm for Solving 0–1 Knapsack Problem
- (2015) Yongquan Zhou et al. NEURAL PROCESSING LETTERS
- Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems
- (2015) Djaafar Zouache et al. SOFT COMPUTING
- Flower pollination algorithm: A novel approach for multiobjective optimization
- (2013) Xin-She Yang et al. ENGINEERING OPTIMIZATION
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- (2012) Jagdish Chand Bansal et al. APPLIED MATHEMATICS AND COMPUTATION
- Solving 0–1 knapsack problem by a novel global harmony search algorithm
- (2010) Dexuan Zou et al. APPLIED SOFT COMPUTING
- A novel global harmony search algorithm for reliability problems
- (2009) Dexuan Zou et al. COMPUTERS & INDUSTRIAL ENGINEERING
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now