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

Article Details
Title:	Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
Article URLs:	https://doi.org/10.1137/1.9781611974782.152 http://dl.acm.org/citation.cfm?id=3039838
Alternative Article URLs:
Authors:	Shi Li	State University of New York at Buffalo, Department of Computer Science and Engineering
Sharing:	Unknown
Verification:	Author has not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1566356
DBLP Key:	conf/soda/Li17
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2017