Gábor Pataki

According to our database, Gábor Pataki authored at least 22 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone.

Gábor Pataki, Aleksandr Touzov

Found. Comput. Math., April, 2024

How Do Exponential Size Solutions Arise in Semidefinite Programming?

Gábor Pataki, Aleksandr Touzov

SIAM J. Optim., March, 2024

2023

A simplified treatment of Ramana's exact dual for semidefinite programming.

Bruno F. Lourenço, Gábor Pataki

Optim. Lett., March, 2023

2019

Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs.

Gábor Pataki

SIAM Rev., 2019

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs.

Yuzixuan Zhu, Gábor Pataki, Quoc Tran-Dinh

Math. Program. Comput., 2019

2018

Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming.

Minghui Liu, Gábor Pataki

Math. Program., 2018

2017

Bad Semidefinite Programs: They All Look the Same.

Gábor Pataki

SIAM J. Optim., 2017

2015

Exact Duality in Semidefinite Programming Based on Elementary Reformulations.

Minghui Liu, Gábor Pataki

SIAM J. Optim., 2015

Coordinate Shadows of Semidefinite and Euclidean Distance Matrices.

Dmitriy Drusvyatskiy, Gábor Pataki, Henry Wolkowicz

SIAM J. Optim., 2015

2010

Basis Reduction and the Complexity of Brand-and-Bound.

Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Column basis reduction and decomposable knapsack problems.

Bala Krishnamoorthy, Gábor Pataki

Discret. Optim., 2009

Basis Reduction, and the Complexity of Branch-and-Bound

Gábor Pataki, Mustafa Kemal Tural

CoRR, 2009

2008

Branching proofs of infeasibility in low density subset sum problems

Gábor Pataki, Mustafa Kemal Tural

CoRR, 2008

2007

On the Closedness of the Linear Image of a Closed Convex Cone.

Gábor Pataki

Math. Oper. Res., 2007

2004

Schlumberger Optimizes Receiver Location for Automated Meter Reading.

Srinagesh Gavirneni, Lloyd Clark, Gábor Pataki

Interfaces, 2004

2003

Teaching Integer Programming Formulations Using the Traveling Salesman Problem.

Gábor Pataki

SIAM Rev., 2003

2001

On the generic properties of convex optimization problems in conic form.

Gábor Pataki, Levent Tunçel

Math. Program., 2001

Octane: A New Heuristic for Pure 0-1 Programs.

Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki

Oper. Res., 2001

1998

On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues.

Gábor Pataki

Math. Oper. Res., 1998

Solving Integer and Disjunctive Programs by Lift and Project.

Sebastián Ceria, Gábor Pataki

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

Cone-LP's and Semidefinite Programs: Geometry.

Gábor Pataki

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1993

Polyhedral methods for the maximum clique problem.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki

Proceedings of the Cliques, 1993