arrow
返回

An integer linear programming model for the label printing problem

delete2023-03-29
delete0
PRE
AI
徐
徐德华 (Dehua Xu)
Y
Yuan Shen *
Y
Yu Cao
L
Limin Xu
F
Fengzhao Yang
Y
Yunzhou Xie
DOI:10.1111/itor.13291delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In a recent paper published in this journal, Alonso-Pecina et al. collect several sets of benchmark instances for the label printing problem from the literature and they also propose their own instances. Due to the intractability of the problem, no optimal solutions were declared for most of these instances. In this paper, we propose an integer linear programming model for the problem. We obtain optimal solutions or show that the solutions provided in the literature are already optimal for most of these instances based on the model. For some of the rest instances, we provide better solutions compared to the previous best solutions in the literature.
Keyword:
label printing
benchmark instances
optimal solutions
integer linear programming

期刊

International Transactions in Operational Research 封面图
International Transactions in Operational Research
IF:
2.9
论文数:
1.8K
被引数:
3.7K

机构

I
Imperial College London
学者数:
8.3W
论文数: 7.3W
被引数: 11.1W
引用论文

引用论文

A heuristic for the label printing problem
err2007-09-01
err13
PREAI
errYiu, K. F. C.; Mak, K. L.; Lau, H. Y. K.
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Two heuristics for the label printing problem
err2021-07-29
err4
PREAI
errAlonso-Pecina, Federico; Arellano-Verdejo, Javier; Diego-Celis, Rocio
err分享
err收藏
Towards an efficient resolution of printing problems
err2014-11-01
err0
errOAAI
errDaniel Tuyttens; Arnaud Vandaele
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
没有更多内容