arrow
Return

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
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
label printing
benchmark instances
optimal solutions
integer linear programming

Journal

International Transactions in Operational Research cover
International Transactions in Operational Research
IF:
2.9
Papers:
1.8K
Citations:
3.7K

Organization

I
Imperial College London
Scholars:
8.3W
Papers: 7.3W
Citations: 11.1W
Cited Papers

Cited Papers

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