Gábor Pataki - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2024

How Do Exponential Size Solutions Arise in Semidefinite Programming?Gábor Pataki, Aleksandr Touzov. siamjo, 34(1):977-1005, March 2024. [doi]

2023

A simplified treatment of Ramana's exact dual for semidefinite programmingBruno F. Lourenço, Gábor Pataki. ol, 17(2):219-243, March 2023. [doi]

2019

Characterizing Bad Semidefinite Programs: Normal Forms and Short ProofsGábor Pataki. siamrev, 61(4):839-859, 2019. [doi]

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programsYuzixuan Zhu, Gábor Pataki, Quoc Tran-Dinh. mpc, 11(3):503-586, 2019. [doi]

2018

Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programmingMinghui Liu, Gábor Pataki. mp, 167(2):435-480, 2018. [doi]

2017

Bad Semidefinite Programs: They All Look the SameGábor Pataki. siamjo, 27(1):146-172, 2017. [doi]

2015

Coordinate Shadows of Semidefinite and Euclidean Distance MatricesDmitriy Drusvyatskiy, Gábor Pataki, Henry Wolkowicz. siamjo, 25(2):1160-1178, 2015. [doi]

Exact Duality in Semidefinite Programming Based on Elementary ReformulationsMinghui Liu, Gábor Pataki. siamjo, 25(3):1441-1454, 2015. [doi]

2010

Basis Reduction and the Complexity of Brand-and-BoundGábor Pataki, Mustafa Tural, Erick B. Wong. soda 2010: 1254-1261 [doi]

2009

Column basis reduction and decomposable knapsack problemsBala Krishnamoorthy, Gábor Pataki. disopt, 6(3):242-270, 2009. [doi]

2004

Schlumberger Optimizes Receiver Location for Automated Meter ReadingSrinagesh Gavirneni, Lloyd Clark, Gábor Pataki. interfaces, 34(3):208-214, 2004. [doi]

2003

Teaching Integer Programming Formulations Using the Traveling Salesman ProblemGábor Pataki. siamrev, 45(1):116-123, 2003. [doi]

2001

Octane: A New Heuristic for Pure 0-1 ProgramsEgon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki. ior, 49(2):207-225, 2001. [doi]

On the generic properties of convex optimization problems in conic formGábor Pataki, Levent Tunçel. mp, 89(3):449-457, 2001. [doi]

1998

Solving Integer and Disjunctive Programs by Lift and ProjectSebastián Ceria, Gábor Pataki. ipco 1998: 271-283 [doi]

On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal EigenvaluesGábor Pataki. mor, 23(2):339-358, 1998. [doi]

1996

Cone-LP s and Semidefinite Programs: GeometryGábor Pataki. ipco 1996: 162-174

1993

Polyhedral methods for the maximum clique problem EGON BALAS, SABASTIAN CERIA, GERARD CORNUEJOLS, ANDGábor Pataki. dimacs 1996: 11-28

Sign in or sign up to see more results.

runs on WebDSL