Solving the one-dimensional bin packing problem with a weight annealing heuristic

Author:

Loh Kok-Hua,Golden Bruce,Wasil Edward

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference20 articles.

1. Computers and intractabililty: a guide to the theory of NP-completeness;Garey,1979

2. Knapsack problems: algorithms and computer implementations;Martello,1990

3. BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem;Scholl;Computers & Operations Research,1997

4. A new lower bound for the bin-packing problem and its integration into MTP and BISON;Schwerin;Pesquisa Operacional,1999

5. Coffman E, Garey M, Johnson D. Approximation algorithms for bin packing: a survey in: Approximation algorithms for NP-hard problems [D. Hochbaum, editor], vol. 46–93. Boston, MA: PWS Publishing; 1997.

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

1. QAL-BP: an augmented Lagrangian quantum approach for bin packing;Scientific Reports;2024-03-01

2. Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints;International Journal of Industrial Engineering Computations;2024

3. 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

4. Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows;Computers & Operations Research;2023-09

5. A Grouping Genetic Algorithm for the Temporal Vector Bin Packing Problem;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3