Author:
Conforti Michele,Fiorini Samuel,Huynh Tony,Weltge Stefan
Publisher
Springer International Publishing
Reference19 articles.
1. Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: STOC 2017–Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1206–1219. ACM, New York (2017)
2. Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3–51 (1979). discrete optimization (Proc. Adv. Res. Inst. Discrete Optimization and Systems Appl., Banff, Alta., 1977), II
3. Barahona, F., Mahjoub, A.R.: Compositions of graphs and polyhedra ii: stable sets. SIAM J. Discrete Math. 7(3), 359–371 (1994)
4. Bonifas, N., Di Summa, M., Eisenbrand, F., Hähnle, N., Niemeier, M.: On sub-determinants and the diameter of polyhedra. Discrete Comput. Geom. 52(1), 102–115 (2014)
5. Cevallos, A., Weltge, S., Zenklusen, R.: Lifting linear extension complexity bounds to the mixed-integer setting. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’18, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 788–807 (2018).
http://dl.acm.org/citation.cfm?id=3174304.3175321
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献