Author:
Faenza Yuri,Malinović Igor,Mastrolilli Monaldo,Svensson Ola
Publisher
Springer International Publishing
Reference15 articles.
1. Bazzi, A., Fiorini, S., Huang, S., Svensson, O.: Small extended formulation for knapsack cover inequalities from monotone circuits. In: Proceedings of SODA 2017, pp. 2326–2341 (2017)
2. Bienstock, D.: Approximate formulations for 0–1 knapsack sets. Oper. Res. Lett. 36(3), 317–320 (2008)
3. Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. Math. Program. 105(1), 9–27 (2006)
4. Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of SODA 2000, pp. 106–115 (2000)
5. Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-319-11008-0
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献