Gábor Pataki

Orcid: 0000-0001-6377-9806

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone.
Found. Comput. Math., April, 2024

How Do Exponential Size Solutions Arise in Semidefinite Programming?
SIAM J. Optim., March, 2024

2023
A simplified treatment of Ramana's exact dual for semidefinite programming.
Optim. Lett., March, 2023

2019
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs.
SIAM Rev., 2019

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs.
Math. Program. Comput., 2019

2018
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming.
Math. Program., 2018

2017
Bad Semidefinite Programs: They All Look the Same.
SIAM J. Optim., 2017

2015
Exact Duality in Semidefinite Programming Based on Elementary Reformulations.
SIAM J. Optim., 2015

Coordinate Shadows of Semidefinite and Euclidean Distance Matrices.
SIAM J. Optim., 2015

2010
Basis Reduction and the Complexity of Brand-and-Bound.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Column basis reduction and decomposable knapsack problems.
Discret. Optim., 2009

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

2008
Branching proofs of infeasibility in low density subset sum problems
CoRR, 2008

2007
On the Closedness of the Linear Image of a Closed Convex Cone.
Math. Oper. Res., 2007

2004
Schlumberger Optimizes Receiver Location for Automated Meter Reading.
Interfaces, 2004

2003
Teaching Integer Programming Formulations Using the Traveling Salesman Problem.
SIAM Rev., 2003

2001
On the generic properties of convex optimization problems in conic form.
Math. Program., 2001

Octane: A New Heuristic for Pure 0-1 Programs.
Oper. Res., 2001

1998
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues.
Math. Oper. Res., 1998

Solving Integer and Disjunctive Programs by Lift and Project.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996
Cone-LP's and Semidefinite Programs: Geometry.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1993
Polyhedral methods for the maximum clique problem.
Proceedings of the Cliques, 1993


  Loading...