Bin packing with fragmentable items: Presentation and approximations-Reference-Cited by-同舟云学术

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

Bin packing with fragmentable items: Presentation and approximations

Published:2015-10 Issue: Volume:602 Page:50-59
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

LeCun Bertrand^ORCID,Mautor Thierry,Quessette Franck^ORCID,Weisser Marc-Antoine^ORCID

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. Worst-case performance bounds for simple one-dimensional packing algorithms;Johnson;SIAM J. Comput.,1974

2. A typology of cutting and packing problems;Dyckhoff;European J. Oper. Res.,1990

3. A comparative study on heuristic procedures to solve bin packing problems;Yesodha;Inform. Process. Lett.,1991

4. Approximation algorithms for bin packing: a survey;Coffman,1996

5. An efficient approximation scheme for the one-dimensional bin-packing problem;Karmarkar,1982

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

1. Artificial intelligence in positive mental health: a narrative review;Frontiers in Digital Health;2024-03-18

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

3. Improving Wheat Yield Estimating by Using Satellites Data and Machine Learning—Deep Learning Algorithm-In Morocco;Artificial Intelligence and Green Computing;2023

4. Two-Stage Optimization Methods to Solve the DNA-Sample Allocation Problem;Mathematics;2022-11-19

5. Meddal: meeting deadlines and data locality via bin packing in cloud environment;Computing;2022-10-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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