Date and Time
2020-07-24 10:00 오전
Karmarkar’s Method is possible to create an algorithm for linear programming characterized by polynomial complexity and, moreover, that was competitive with the simplex method.
권한이 없습니다. 로그인 부탁드립니다. You don't have permission to access. Please login.
Convex Optimization (Cambridge University Press 2004)