A polyhedral approach to a production planning problem
type: Item
instance of: scholarly article
title: A polyhedral approach to a production planning problem
zbMATH Open document ID: 0997.90031
DOI: 10.1023/A:1018963805173
published in: Annals of Operations Research
publication date: 2001-01-17T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1554222
zbMATH Keywords: production planning
zbMATH Keywords: valid inequalities
zbMATH Keywords: cutting plane algorithm
author: Miguel Constantino
MaRDI profile type: MaRDI publication profile
full work available at URL: a:1018963805173
OpenAlex ID: W55804789
Recommended article: A cutting plane approach to capacitated lot-sizing with start-up costs
Recommended article: Facets and algorithms for capacitated lot sizing
Recommended article: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
Recommended article: On the polyhedral structure of a multi-item production planning model with setup times
Recommended article: Production Planning by Mixed Integer Programming
description: scientific article; zbMATH DE number 1554222