Author:
Basu Roy Aniket,Bougeret Marin,Goldberg Noam,Poss Michael
Publisher
Springer International Publishing
Reference18 articles.
1. Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427–438 (2009)
2. Álvarez-Miranda, E., Ljubic, I., Toth, P.: A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11(4), 349–360 (2013).
https://doi.org/10.1007/s10288-013-0231-6
3. Balogh, J., Békési, J., Dósa, G., Sgall, J., van Stee, R.: The optimal absolute ratio for online bin packing. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (2015)
4. LIPIcs;J Balogh,2018
5. Basu Roy, A., Bougeret, M., Goldberg, N., Poss, M.: Approximating the robust bin-packing with budget uncertainty (2019).
https://hal.archives-ouvertes.fr/hal-02119351
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献