Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities

DOI10.1137/1.9781611974782.152zbMath1418.90018OpenAlexW2952903233MaRDI QIDQ4575900

Shi Li

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.152

zbMATH Keywords

approximation algorithmlot-sizing problem

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)

Related Items (2)

A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems ⋮ Easy capacitated facility location problems, with connections to lot-sizing

This page was built for publication: Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities