Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference18 articles.
1. Balogh J, Békési J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440:1–13
2. Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Prog 88(3):411–424
3. Bertsimas D (1988) Probabilistic combinatorial optimization problems. Ph.D. thesis, Massachusetts Institute of Technology
4. Coffman EG Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. In: Pardalos PM, Du DZ, Graham RL (eds) Handbook of combinatorial optimization. Springer, New York, pp 455–531
5. Dósa G, Sgall J (2013) First fit bin packing: a tight analysis. In: LIPIcs-Leibniz international proceedings in informatics, vol. 20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献