Facets and algorithms for capacitated lot sizing
Copyright policy )Facets and algorithms for capacitated lot sizing
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Yale University United States
- Massachusetts Institute of Technology United States
cutting plane/branch and bound, single-item capacitated version, Integer programming, Inventory, storage, reservoirs, valid inequalities, Applications of mathematical programming, Numerical mathematical programming methods, multi-item applications, dynamic economic lot sizing, Polytopes and polyhedra, polyhedral structure, Production models, Computational results
cutting plane/branch and bound, single-item capacitated version, Integer programming, Inventory, storage, reservoirs, valid inequalities, Applications of mathematical programming, Numerical mathematical programming methods, multi-item applications, dynamic economic lot sizing, Polytopes and polyhedra, polyhedral structure, Production models, Computational results
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).71 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!