A heuristic routine for solving large loading problems-Reference-Cited by-同舟云学术

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

A heuristic routine for solving large loading problems

Published:1979-12 Issue:4 Volume:26 Page:643-650
ISSN:0028-1441
Container-title:Naval Research Logistics Quarterly
language:en
Short-container-title:Naval Research Logistics

Author:

Fisk John C.,Hung Ming S.

Publisher

Wiley

Subject

General Engineering

Reference13 articles.

1. “Merging and Sorting Applied to the 0-1 Knapsack Problem,”;Ahrens;Operations Research,1975

2. “An Additive Algorithm for Solving Linear Programs with Zero-One Variables,”;Balas;Operations Research,1965

3. “Discrete Programming by the Filter Method,”;Balas;Operations Research,1967

4. “The Loading Problem,”;Eilon;Management Science,1971

5. “An Initial Bounding Procedure for Use with 0-1 Single Knapsack Algorithms,”;Fisk;Opsearch,1977

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

1. Matheuristics: survey and synthesis;International Transactions in Operational Research;2023-04-15

2. A Branch-and-Price Algorithm for the Multiple Knapsack Problem;INFORMS Journal on Computing;2022-11

3. Mathematical models and decomposition methods for the multiple knapsack problem;European Journal of Operational Research;2019-05

4. Ad Revenue Optimization in Live Broadcasting;Management Science;2016-04

5. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem;SIAM Journal on Computing;2005-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP