Author:
Borst Sander,Dadush Daniel,Huiberts Sophie,Tiwari Samarth
Publisher
Springer International Publishing
Reference13 articles.
1. Beier, R., Vöcking, B.: Probabilistic analysis of knapsack core algorithms. In: Munro, J.I. (ed.) Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, 11–14 Jan 2004, pp. 468–477. SIAM (2004)
2. Borst, S., Dadush, D., Huiberts, S., Tiwari, S.: On the Integrality Gap of Binary Integer Programs with Gaussian Data. arXiv:2012.08346 [cs, math] (Dec 2020)
3. Dey, S.S., Dubey, Y., Molinaro, M.: Branch-and-bound solves random binary IPs in polytime. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 579–591. Society for Industrial and Applied Mathematics (Jan 2021). https://doi.org/10.1137/1.9781611976465.35
4. Dyer, M., Frieze, A.: Probabilistic analysis of the generalised assignment problem. Math. Program. 55(1–3), 169–181 (1992). https://doi.org/10.1007/bf01581197
5. Dyer, M., Frieze, A.: Probabilistic analysis of the multidimensional knapsack problem. Math. OR 14(1), 162–176 (1989). https://doi.org/10.1287/moor.14.1.162
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献