Daniel Dadush, A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column
Room B332 IBS (기초과학연구원)We give a strongly polynomial algorithm for minimum cost generalized flow, and hence for optimizing any linear program with at most two non-zero entries per row, or at most two …