Skip to main content
Conference Proceedings

Improved randomized approximation algorithms for lot-sizing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1084 359-373
DOI: 10.1007/3-540-61310-2_27
3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Teo, C. P., & Bertsimas, D. (1996). Improved randomized approximation algorithms for lot-sizing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1084, pp. 359–373). Springer Verlag. https://doi.org/10.1007/3-540-61310-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free