Browsing Combinatorics and Optimization by Subject "Linear Programming"
Now showing items 1-2 of 2
-
Numerical Stability in Linear Programming and Semidefinite Programming
(University of Waterloo, 2006)We study numerical stability for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. ... -
Properties of Stable Matchings
(University of Waterloo, 2010-12-17)Stable matchings were introduced in 1962 by David Gale and Lloyd Shapley to study the college admissions problem. The seminal work of Gale and Shapley has motivated hundreds of research papers and found applications in ...