相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A binary moth search algorithm based on self-learning for multidimensional knapsack problems
Yanhong Feng et al.
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2022)
Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems
Ran Wang et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2021)
An Improved Particle Swarm Optimization with Chaotic Inertia Weight and Acceleration Coefficients for Optimal Extraction of PV Models Parameters
Arooj Tariq Kiani et al.
ENERGIES (2021)
A Binary Equilibrium Optimization Algorithm for 0-1 Knapsack Problems
Mohamed Abdel-Basset et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2021)
Particle Swarm Optimization Based on a Novel Evaluation of Diversity
Haohao Zhou et al.
ALGORITHMS (2021)
Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm
Congcong Wu et al.
APPLIED INTELLIGENCE (2020)
A novel discrete whale optimization algorithm for solving knapsack problems
Ya Li et al.
APPLIED INTELLIGENCE (2020)
A Hybrid Multi-Step Probability Selection Particle Swarm Optimization with Dynamic Chaotic Inertial Weight and Acceleration Coefficients for Numerical Function Optimization
Yuji Du et al.
SYMMETRY-BASEL (2020)
A Discrete Particle Swarm Optimization to Solve the Put-Away Routing Problem in Distribution Centres
Rodrigo Andres Gomez-Montoya et al.
COMPUTATION (2020)
A Particle Swarm Optimization Algorithm for the Solution of the Transit Network Design Problem
Ernesto Cipriani et al.
SMART CITIES (2020)
Low-Complexity Tracking Control of Strict-Feedback Systems With Unknown Control Directions
Jin-Xi Zhang et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2019)
Admissibility and robust stabilization of continuous linear singular fractional order systems with the fractional order α: The 0 < α < 1 case
Xuefeng Zhang et al.
ISA TRANSACTIONS (2018)
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
Yanhong Feng et al.
NEURAL COMPUTING & APPLICATIONS (2018)
Easy knapsacks and the complexity of energy allocation problems in the smart grid
Theo Karaboghossian et al.
OPTIMIZATION LETTERS (2018)
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
Yan-Hong Feng et al.
IEEE ACCESS (2018)
An Accelerated Convergent Particle Swarm Optimizer (ACPSO) of Multimodal Functions
Yasir Mehmood et al.
INTELLIGENT AUTOMATION AND SOFT COMPUTING (2018)
Fitness-based Acceleration Coefficients to Enhance the Convergence Speed of Novel Binary Particle Swarm Optimization
Yasir Mehmood et al.
2018 INTERNATIONAL CONFERENCE ON FRONTIERS OF INFORMATION TECHNOLOGY (FIT 2018) (2018)
Discrete differential evolutions for the discounted {0-1} knapsack problem
Hong Zhu et al.
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION (2017)
Exact and approximate algorithms for discounted {0-1} knapsack problem
Yi-Chao He et al.
INFORMATION SCIENCES (2016)
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
Peter Jacko
ANNALS OF OPERATIONS RESEARCH (2016)
Algorithms for randomized time-varying knapsack problems
Yichao He et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2016)
A fuzzy hybrid project portfolio selection method using Data Envelopment Analysis, TOPSIS and Integer Programming
Madjid Tavana et al.
EXPERT SYSTEMS WITH APPLICATIONS (2015)
Dynamic programming based algorithms for the discounted {0-1} knapsack problem
Aiying Rong et al.
APPLIED MATHEMATICS AND COMPUTATION (2012)
Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem
Zhi-gang Ren et al.
INFORMATION SCIENCES (2012)
分享论文
