发布求助
文献互助 智能选刊 最新文献

An improved discreet Jaya optimization algorithm with mutation operator and opposition based learning to solve the 0-1 knapsack problem.

Q3 Mathematics
International Journal of Mathematics in Operational Research Pub Date : 2023-01-01 DOI:10.1504/ijmor.2023.10059475
Mohammed Al Eiadeh, Mohammad Batah
{"title":"An improved discreet Jaya optimization algorithm with mutation operator and opposition based learning to solve the 0-1 knapsack problem.","authors":"Mohammed Al Eiadeh, Mohammad Batah","doi":"10.1504/ijmor.2023.10059475","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":38619,"journal":{"name":"International Journal of Mathematics in Operational Research","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mathematics in Operational Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijmor.2023.10059475","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
分享
查看原文 本刊更多论文
基于变异算子和对立学习的改进离散Jaya优化算法求解0-1背包问题。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Mathematics in Operational Research
International Journal of Mathematics in Operational Research Decision Sciences-Decision Sciences (all)
CiteScore
2.10
自引率
0.00%
发文量
44
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信