Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
Author:
Publisher
Elsevier BV
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference45 articles.
1. Heuristic 0–1 linear programming;Zanakis;Manage Sci,1977
2. An approximate dynamic programming approach to multidimensional knapsack problems;Bertsimas;Manage Sci,2002
3. Heuristics for the 0–1 multidimensional knapsack problem;Boyer;Eur J Oper Res,2009
4. Reduced costs propagation in an efficient implicit enumeration for the 0–1 multidimensional knapsack problem;Vimont;J Comb Optim,2008
5. Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method;Li;Comput Oper Res,2012
Cited by 62 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An adaptive binary quantum-behaved particle swarm optimization algorithm for the multidimensional knapsack problem;Swarm and Evolutionary Computation;2024-04
2. A multi-neighborhood tabu search for solving multi-budget maximum coverage problem;Applied Soft Computing;2024-03
3. Energy-Aware Controller Load Distribution in Software-Defined Networking;2024 International Conference on Electronics, Information, and Communication (ICEIC);2024-01-28
4. A Framework for Valuation and Portfolio Optimization of Venture Capital Deals with Contractual Terms;Mathematical Problems in Engineering;2024-01-25
5. COMBINATORIAL PROPERTIES OF THE BOUNDED KNAPSACK PROBLEM;PRIKL DISKRETN MAT;2024
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3