Combinatorial Optimization


FDS Colloquium: Bento Natura (Columbia), “Faster Exact Linear Programming”

Optional Zoom link: https://yale.zoom.us/j/99342713421 Abstract: We present a novel algorithm to solve various subclasses of linear programs, with a particular focus on strongly polynomial […]

Page 1 of 1