Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Business, Management and Accounting (miscellaneous)
Link
http://link.springer.com/content/pdf/10.1007/BF01720210.pdf
Reference35 articles.
1. Adamowicz M, Albano A (1976) A solution of the rectangular cutting-stock problem. IEEE Trans Syst Man Cybern SMC-6:302–310
2. Beasley JE (1985a) An exact two-dimensional non-guil-lotine cutting tree search procedure. Oper Res 33:49–64
3. Beasley JE (1985b) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297–306
4. Biro M, Biros E (1984) Network flows and non-guillotine cutting patterns. E J Oper Res 16:215–221
5. Chambers ML, Dyson RG (1976) The cutting stock problem in the flat glass industry selection of stock sizes. Oper Res Q 27:949–957
Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants;International Transactions in Operational Research;2022-02-24
2. Process Optimization for Cutting Steel-Plates;Proceedings of the 6th International Conference on Operations Research and Enterprise Systems;2017
3. Two-stage two-dimensional guillotine cutting stock problems with usable leftover;International Transactions in Operational Research;2014-02-10
4. Modelos lineares e não lineares inteiros para problemas da mochila bidimensional restrita a 2 estágios;Production;2013-05-14
5. Exact algorithm for generating two-segment cutting patterns of punched strips;Applied Mathematical Modelling;2007-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3