Efficient lower bounds and heuristics for the variable cost and size bin packing problem
Author:
Publisher
Elsevier BV
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference15 articles.
1. Knapsack problems—algorithms and computer implementations;Martello,1990
2. A typology of cutting and packing problems;Dyckhoff;European Journal of Operational Research,1990
3. An improved typology of cutting and packing problems;Wäsher;European Journal of Operational Research,2007
4. Monaci M. Algorithms for packing and scheduling problems. PhD thesis, Universit di Bologna; 2002.
5. The two-dimensional bin packing problem with variable bin sizes and costs;Pisinger;Discrete Optimization,2005
Cited by 65 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Benders decomposition for robust distribution network design and operations in online retailing;European Journal of Operational Research;2024-02
2. A GA-Based Scheduling Algorithm for Semiconductor-Product Thermal Cycling Tests;Lecture Notes in Electrical Engineering;2024
3. Designing Large-Scale Intelligent Collaborative Platform for Freight Forwarders;2023 IEEE Symposium Series on Computational Intelligence (SSCI);2023-12-05
4. Bin packing problem with restricted item fragmentation: Assignment of jobs in multi-product assembly environment with overtime;An International Journal of Optimization and Control: Theories & Applications (IJOCTA);2023-11-03
5. Multi-item dynamic lot sizing with multiple transportation modes and item fragmentation;International Journal of Production Economics;2023-11
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3