A heuristic for the label printing problem
type: Item
instance of: scholarly article
title: A heuristic for the label printing problem
zbMATH Open document ID: 1141.90491
published in: Computers \& Operations Research
publication date: 2007-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5142321
zbMATH Keywords: label printing
zbMATH Keywords: nonlinear integer programming
zbMATH Keywords: heuristic
zbMATH Keywords: simulating annealing
author: Ka Fai Cedric Yiu
author: Kai-Ling Mak
author: Henry Ying Kei Lau
MaRDI profile type: Publication
full work available at URL: j.cor.2005.09.021
OpenAlex ID: W2019450128
cites work: An improved branch and bound algorithm for mixed integer nonlinear programs
cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
cites work: Optimization by Simulated Annealing
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Q5289009
DOI: 10.1016/J.COR.2005.09.021
description: scientific article; zbMATH DE number 5142321