A Branch Search Algorithm for the Knapsack Problem-Reference-Cited by-同舟云学术

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

A Branch Search Algorithm for the Knapsack Problem

Published:1970-01 Issue:5 Volume:16 Page:327-332
ISSN:0025-1909
Container-title:Management Science
language:en
Short-container-title:Management Science

Author:

Greenberg Harold,Hegerich Robert L.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Strategy and Management

Link

https://pubsonline.informs.org/doi/pdf/10.1287/mnsc.16.5.327

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

1. R-Storm;Proceedings of the 16th Annual Middleware Conference;2015-11-24

2. A Bridging Model for Branch-and-Bound Algorithms on Multi-core Architectures;2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming;2012-12

3. Modeling the Distribution Setting of Parking Tracks for Disabled Trains in Urban Rail Transit System of China;Journal of Transportation Systems Engineering and Information Technology;2010-10

4. Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem;Discrete Mathematics and Applications;2010-01

5. An Improved Iterated Local Search Algorithm for Invest Strongly Correlated 0/1 Knapsack Problem;2009 International Forum on Computer Science-Technology and Applications;2009

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP