Improved lower bounds for the capacitated lot sizing problem with setup times.
type: Item
instance of: scholarly article
title: Improved lower bounds for the capacitated lot sizing problem with setup times.
zbMATH Open document ID: 1137.90584
author: Raf Jans
author: Zeger Degraeve
published in: Operations Research Letters
publication date: 2004-01-05T00:00:00Z
full work available at URL: ERS-2003-026-LIS.pdf
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2021250
zbMATH Keywords: Capacitated lot sizing
zbMATH Keywords: Dantzig-Wolfe decomposition
zbMATH Keywords: Lagrange
zbMATH Keywords: relaxation
zbMATH Keywords: Lower bounds
describes a project that uses: Knapsack
describes a project that uses: LINDO
MaRDI profile type: Publication
OpenAlex ID: W2116355414
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem
cites work: Capacitated lot-sizing and scheduling by Lagrangean relaxation
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: A minimal algorithm for the multiple-choice knapsack problem
cites work: The Multiple-Choice Knapsack Problem
cites work: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
cites work: Dynamic version of the economic lot size model
DOI: 10.1016/J.ORL.2003.06.001
description: scientific article; zbMATH DE number 2021250