Lower bounds and algorithms for the minimum cardinality bin covering problem
详细信息 查看全文
- 作者：Rico Walter ; rico.walter@uni-jena.de" class="auth_mail" title="E-mail the corresponding author ; Alexander Lawrinenko alexander.lawrinenko@uni-jena.de" class="auth_mail" title="E-mail the corresponding author
- 关键词：Bin covering ; Minimum cardinality ; Lower bounds ; Heuristics ; Branch-and-bound
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：16 January 2017
- 年：2017
- 卷：256
- 期：2
- 页码：392-403
- 全文大小：545 K
文摘
- class="listitem" id="list_celist0003">
- class="label">•
We study the dual version of the minimum cardinality bin packing problem.
- class="label">•
We develop strong lower bounds and analyze their worst-case performances.
- class="label">•
We suggest constructive heuristics and a subset sum-based improvement heuristic.
- class="label">•
We propose a branch-and-bound algorithm to determine an optimal solution.
- class="label">•
Our algorithms proved to be effective on a wide range of randomly generated instances.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |