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 | 425 | 1998 |

The geometry of semidefinite programming G Pataki Handbook of semidefinite programming, 29-65, 2000 | 122 | 2000 |

Teaching integer programming formulations using the traveling salesman problem G Pataki SIAM review 45 (1), 116-123, 2003 | 121 | 2003 |

OCTANE: A new heuristic for pure 0–1 programs E Balas, S Ceria, M Dawande, F Margot, G Pataki Operations Research 49 (2), 207-225, 2001 | 103 | 2001 |

Cone-LP's and semidefinite programs: Geometry and a simplex-type method G Pataki International Conference on Integer Programming and Combinatorial …, 1996 | 85 | 1996 |

Strong duality in conic linear programming: facial reduction and extended duals G Pataki Computational and analytical mathematics, 613-634, 2013 | 81 | 2013 |

A principal component analysis for trees B Aydin, G Pataki, H Wang, E Bullitt, JS Marron The Annals of Applied Statistics, 1597-1615, 2009 | 78 | 2009 |

On the closedness of the linear image of a closed convex cone G Pataki Mathematics of Operations Research 32 (2), 395-412, 2007 | 68 | 2007 |

On the generic properties of convex optimization problems in conic form G Pataki, L Tunçel Mathematical Programming 89 (3), 449-457, 2001 | 66 | 2001 |

Polyhedral methods for the maximum clique problem E Balas DI-MACS Series in Discrete Mathematics and Theoretical Computer Science, 11-28, 1996 | 66 | 1996 |

The DIMACS library of semidefinite-quadratic-linear programs G Pataki, S Schmieta Tech. Rep. Preliminary draft, Computational Optimization Research Center …, 2002 | 46 | 2002 |

Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming M Liu, G Pataki Mathematical Programming 167 (2), 435-480, 2018 | 43 | 2018 |

Bad semidefinite programs: they all look the same G Pataki SIAM Journal on Optimization 27 (1), 146-172, 2017 | 43 | 2017 |

Column basis reduction and decomposable knapsack problems B Krishnamoorthy, G Pataki Discrete Optimization 6 (3), 242-270, 2009 | 41 | 2009 |

Coordinate shadows of semidefinite and Euclidean distance matrices D Drusvyatskiy, G Pataki, H Wolkowicz SIAM Journal on Optimization 25 (2), 1160-1178, 2015 | 40 | 2015 |

Solving integer and disjunctive programs by lift and project S Ceria, G Pataki International Conference on Integer Programming and Combinatorial …, 1998 | 36 | 1998 |

A simple derivation of a facial reduction algorithm and extended dual systems G Pataki preprint http://www. unc. edu/~ pataki/papers/fr. pdf 19, 2000 | 34 | 2000 |

On the connection of facially exposed and nice cones G Pataki Journal of Mathematical Analysis and Applications 400 (1), 211-221, 2013 | 32 | 2013 |

Basis reduction and the complexity of branch-and-bound G Pataki, M Tural, EB Wong Proceedings of the twenty-first annual ACM-SIAM symposium on discrete …, 2010 | 31 | 2010 |

Exact duality in semidefinite programming based on elementary reformulations M Liu, G Pataki SIAM Journal on Optimization 25 (3), 1441-1454, 2015 | 30 | 2015 |