Worst case analysis for deterministic online algorithm in capacitated lot-sizing problem
E. Kaganova, AIP Conference Proceedings 1638 (2011).
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Author
Kaganova, Ekaterina
Publishing Year
Journal Title
AIP Conference Proceedings
Volume
1638
LibreCat-ID
Cite this
Kaganova E. Worst case analysis for deterministic online algorithm in capacitated lot-sizing problem. AIP Conference Proceedings. 2011;1638.
Kaganova, E. (2011). Worst case analysis for deterministic online algorithm in capacitated lot-sizing problem. AIP Conference Proceedings, 1638.
@article{Kaganova_2011, title={Worst case analysis for deterministic online algorithm in capacitated lot-sizing problem}, volume={1638}, journal={AIP Conference Proceedings}, author={Kaganova, Ekaterina}, year={2011} }
Kaganova, Ekaterina. “Worst Case Analysis for Deterministic Online Algorithm in Capacitated Lot-Sizing Problem.” AIP Conference Proceedings 1638 (2011).
E. Kaganova, “Worst case analysis for deterministic online algorithm in capacitated lot-sizing problem,” AIP Conference Proceedings, vol. 1638, 2011.
Kaganova, Ekaterina. “Worst Case Analysis for Deterministic Online Algorithm in Capacitated Lot-Sizing Problem.” AIP Conference Proceedings, vol. 1638, 2011.
Google Scholar