An exact algorithm for large unbounded knapsack problems
Author:
Publisher
Elsevier BV
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference20 articles.
1. An algorithm for large zero-one knapsack problems;Balas;Oper. Res.,1980
2. Some applications of the theory of dynamic programming - A review;Bellman;Oper. Res.,1954
3. An enumeration algorithm for knapsack problems;Cabot;Oper. Res.,1970
4. An algorithm for the solution of the 0–1 knapsack problem;Fayard;Computing,1982
5. A hybrid algorithm for finding the k-th smallest of n elements in O(n) time;Fischetti,1988
Cited by 34 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Meta-Heuristic Algorithms based on Integer Programming for Shelf Space Allocation Problems;European Journal of Science and Technology;2022-09-23
2. A Theory of Auto-Scaling for Resource Reservation in Cloud Services;Stochastic Systems;2022-09
3. An enhanced multi-criteria decision-making approach oriented to sustainability analysis of building facades: A case study of Barcelona;Journal of Building Engineering;2022-08
4. Exact optimization and decomposition approaches for shelf space allocation;European Journal of Operational Research;2022-06
5. Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem;Computers & Operations Research;2021-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3