A Binary Equilibrium Optimization Algorithm for 0–1 Knapsack Problems

Author:

Abdel-Basset Mohamed,Mohamed Reda,Mirjalili SeyedaliORCID

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference60 articles.

1. Robust optimization of the 0–1 knapsack problem: Balancing risk and return in assortment optimization;Rooderkerk;European Journal of Operational Research,2016

2. Development of a Novel Freight Railcar Load Planning and Monitoring System;Mladenović;Symmetry,2019

3. The Knapsack Problem and Its Applications to the Cargo Loading Problem;Cho;ANALYSIS OF APPLIED MATHEMATICS,2019

4. The air cargo load planning problem-a consolidated problem definition and literature review on related problems;Brandt;European Journal of Operational Research,2019

5. Computation offloading in wireless multi-hop networks: Energy minimization via multi-dimensional knapsack problem;Müller,2015

Cited by 45 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application;Journal of King Saud University - Computer and Information Sciences;2024-07

2. Binary Electric Eel Foraging Optimization Algorithm for Solving 0-1 Knapsack Problems;2024 6th International Conference on Pattern Analysis and Intelligent Systems (PAIS);2024-04-24

3. An Efficient Binary Hybrid Equilibrium Algorithm for Binary Optimization Problems: Analysis, Validation, and Case Studies;International Journal of Computational Intelligence Systems;2024-04-22

4. A Novel Hybrid Binary Bat Algorithm for Global Optimization;International Journal of Swarm Intelligence Research;2024-04-09

5. Wind farm layout optimization using adaptive equilibrium optimizer;The Journal of Supercomputing;2024-03-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3