An incremental method-based machine learning approach for max–min knapsack with multiple scenarios-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An incremental method-based machine learning approach for max–min knapsack with multiple scenarios

Published:2024-04 Issue: Volume:190 Page:109984
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

Zhao Juntao^ORCID,Hifi Mhand^ORCID,Zhang Yulin^ORCID,Luo Xiaochuan

Publisher

Elsevier BV

Reference25 articles.

1. A cooperative population-based method for solving the max-min knapsack problem with multi-scenarios;Aïder,2022

2. A diversified method for the multi-scenarios max-min knapsack problem;Al Douri,2016

3. Al-douri, T., Hifi, M., & Saleh, S. (2015). A fast algorithm for solving the max-min knapsack problem with two scenarios. In Proceedings of IEEE, international conference on computers & industrial engineering (pp. 672–680).

4. An iterative algorithm for the max-min knapsack problem with multiple scenarios;Al-Douri;Operational Research,2021

5. A two-stage hybrid method for the multi-scenarios max-min knapsack problem;Aldouri;International Journal of Intelligent Engineering Informatics,2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP