Ad hoc heuristic for the cover printing problem-Reference-Cited by-同舟云学术

Ad hoc heuristic for the cover printing problem

Published:2012-02 Issue:1 Volume:9 Page:17-28
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Romero David,Alonso-Pecina Federico

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference16 articles.

1. L.E. Carrera, Algoritmo para encontrar el óptimo a una simplificación de un problema combinatorio presente en la industria editorial, Graduate Thesis, Mathematics Department, Cinvestav, Mexico City, 2006 (in Spanish).

2. An improved typology of cutting and packing problems;Wäscher;European Journal of Operational Research,2007

3. Dynamic programming based algorithms for set multicover and multiset multicover problems;Hua;Theoretical Computer Science,2010

4. Optimal job splitting on a multi-slot machine with applications in the printing industry;Ekici;Naval Research Logistics,2010

5. M. Balinski, Personal communication.

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

1. A Method to Improve Planning of Product Placement on a Printing Sheet;Management and Production Engineering Review;2023-08-07

2. An integer linear programming model for the label printing problem;International Transactions in Operational Research;2023-03-29

3. Iterated local search for the label printing problem;Journal of the Operational Research Society;2023-02-07

4. A two-phase heuristic algorithm for the label printing problem;TOP;2022-03-04

5. Two heuristics for the label printing problem;International Transactions in Operational Research;2021-07-29