On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
type: Item
instance of: scholarly article
title: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
zbMATH Open document ID: 0952.90028
DOI: 10.1016/S0377-2217(99)00461-0
author: Andrew J. Miller
author: G. L. Nemhauser
author: Martin W. P. Savelsbergh
published in: European Journal of Operational Research
publication date: 2000-09-14T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1507976
zbMATH Keywords: integer programming
zbMATH Keywords: capacitated lot-sizing
zbMATH Keywords: continuous 0-1 knapsack problem
MaRDI profile type: Publication
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: A cutting plane approach to capacitated lot-sizing with start-up costs
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Sequence independent lifting in mixed integer programming
cites work: Facets and algorithms for capacitated lot sizing
cites work: The 0-1 knapsack problem with a single continuous variable
cites work: Valid inequalities and separation for capacitated economic lot sizing
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
cites work: Polyhedra for lot-sizing with Wagner-Whitin costs
cites work: Q4840775
cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs
cites work: Dynamic version of the economic lot size model
full work available at URL: s0377-2217(99)00461-0
OpenAlex ID: W2050047854
description: scientific article; zbMATH DE number 1507976