Ad hoc heuristic for the cover printing problem

DOI10.1016/j.disopt.2011.10.002zbMath1242.90203OpenAlexW2029138597MaRDI QIDQ435726

Federico Alonso-Pecina, David Romero

Publication date: 12 July 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2011.10.002

zbMATH Keywords

combinatorial optimizationheuristicinteger nonlinear programmingcover printingjob splittinglabel printing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Two heuristics for the label printing problem ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ A hybrid simulated annealing/linear programming approach for the cover printing problem ⋮ Towards an efficient resolution of printing problems

Cites Work

• Unnamed Item
• A heuristic for the label printing problem
• Genetic algorithms to solve the cover printing problem
• Dynamic programming based algorithms for set multicover and multiset multicover problems
• Using a greedy random adaptative search procedure to solve the cover printing problem
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• An optimization model to determine master designs and runs for advertisement printing
• An improved typology of cutting and packing problems
• Optimal job splitting on a multi-slot machine with applications in the printing industry

This page was built for publication: Ad hoc heuristic for the cover printing problem