.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Polyhedral Approach for Nonconvex Quadratic Programming Problemswith Box Constraints
Journal of Global Optimization
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
Journal of Global Optimization
Bipartite density of cubic graphs
Discrete Mathematics
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Best ellipsoidal relaxation to solve a nonconvex problem
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
The Laplacian spectral radius of a graph under perturbation
Computers & Mathematics with Applications
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
Maximum cut in fuzzy nature: Models and algorithms
Journal of Computational and Applied Mathematics
Max k-cut and approximating the chromatic number of random graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
An exact solution method for unconstrained quadratic 0---1 programming: a geometric approach
Journal of Global Optimization
Small bipartite subgraph polytopes
Operations Research Letters
The expected relative error of the polyhedral approximation of the max-cut problem
Operations Research Letters
A probabilistic result for the max-cut problem on random graphs
Operations Research Letters
On duality gap in binary quadratic programming
Journal of Global Optimization
A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure
Information Sciences: an International Journal
| Hi-index | 0.00 |