Gabor Pataki: research interests, selected papers, and talks
My research is in convex, and integer programming, and applications of optimization. This page contains selected publications, and corresponding talks.
On the Closedness of the Linear Image of a Closed Convex Cone , G. Pataki
Mathematics of Operations Research. Vol 32 (2), 395-412, 2007
The Geometry of Cone-LP's, G. Pataki,
in H. Wolkowicz, L. Vandenberghe and R. Saigal, ed.: The Handbook of Semidefinite Programming, Kluwer, 2000
On the Rank of Extreme Matrices in Semidefinite Programs and the
Multiplicity of Optimal Eigenvalues, G. Pataki
Mathematics of Operations Research, 23 (2), 339-358, 1998
Basis Reduction, and the Complexity of Branch-and-Bound, G. Pataki, M. Tural, E. B. Wong
2010 ACM-SIAM Symposium on Discrete Algorithms (SODA 10)
Column Basis Reduction and Decomposable Knapsack Problems, B. Krishnamoorthy and G. Pataki,
Discrete Optimization, 6(3), August 2009, 242-270
Solving the seymour problem, M. C. Ferris, G. Pataki and S. Schmieta
Optima, 66:1-7, 2001.