Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation-Reference-Cited by-同舟云学术

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

Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation

Published:2025-01 Issue:1 Volume:320 Page:57-68
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Barkel Mathijs^ORCID,Delorme Maxence^ORCID,Malaguti Enrico^ORCID,Monaci Michele^ORCID

Publisher

Elsevier BV

Reference26 articles.

1. Network flows: Theory, algorithms, and applications;Ahuja,1993

2. Binary decision diagrams for bin packing with minimum color fragmentation;Bergman,2019

3. Mathematical models and exact algorithms for the colored bin packing problem;Borges;Computers & Operations Research,2024

4. Bin packing and related problems: General arc-flow formulation with graph compression;Brandão;Computers & Operations Research,2016

5. Mathematical programming algorithms for bin packing problems with item fragmentation;Casazza;Computers & Operations Research,2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP