Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Nonnegative minimum biased quadratic estimation in mixed linear models
Journal of Multivariate Analysis
Semidefinite programming for discrete optimization and matrix completion problems
Discrete Applied Mathematics
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
Interior Point Methods for Second-Order Cone Programming and OR Applications
Computational Optimization and Applications
Efficient Algorithms for the Smallest Enclosing Ball Problem
Computational Optimization and Applications
A primal--dual symmetric relaxation for homogeneous conic systems
Journal of Complexity
Random walks on polytopes and an affine interior point method for linear programming
Proceedings of the forty-first annual ACM symposium on Theory of computing
A p-cone sequential relaxation procedure for 0-1 integer programs
Optimization Methods & Software - GLOBAL OPTIMIZATION
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
SIAM Journal on Matrix Analysis and Applications
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
Mathematics of Operations Research
Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
Numerical Algorithms
On the long-step path-following method for semidefinite programming
Operations Research Letters
Test-assignment: a quadratic coloring problem
Journal of Heuristics
Hi-index | 0.00 |