A strongly polynomial algorithm for bimodular integer linear programming

Stephan Artmann, Robert Weismantel, Rico Zenklusen. A strongly polynomial algorithm for bimodular integer linear programming. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 1206-1219, ACM, 2017. [doi]

Authors

Stephan Artmann

This author has not been identified. Look up 'Stephan Artmann' in Google

Robert Weismantel

This author has not been identified. Look up 'Robert Weismantel' in Google

Rico Zenklusen

This author has not been identified. Look up 'Rico Zenklusen' in Google