A heuristic for the label printing problem

DOI10.1016/j.cor.2005.09.021zbMath1141.90491OpenAlexW2019450128MaRDI QIDQ875404

Kai-Ling Mak, Ka-Fai Cedric Yiu, Henry Ying Kei Lau

Publication date: 13 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.021

zbMATH Keywords

nonlinear integer programmingheuristiclabel printingsimulating annealing

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Minimizing setups and waste when printing labels of consumer goods ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ Two heuristics for the label printing problem ⋮ Ad hoc heuristic for the cover 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
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming

This page was built for publication: A heuristic for the label printing problem