Complexity results on a paint shop problem.
type: Item
instance of: scholarly article
title: Complexity results on a paint shop problem.
zbMATH Open document ID: 1036.90035
DOI: 10.1016/S0166-218X(03)00442-6
author: Th. Epping
author: Winfried. Hochstättler
author: P. Oertel
published in: Discrete Applied Mathematics
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 2055506
zbMATH Keywords: Dynamic programming
zbMATH Keywords: NP-completeness
zbMATH Keywords: Paint shop
zbMATH Keywords: Sequencing
MaRDI profile type: Publication
cites work: Q4198056
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
full work available at URL: s0166-218x(03)00442-6
OpenAlex ID: W2037461057
description: scientific article; zbMATH DE number 2055506