Solving the max-cut problem using eigenvalues

Authors:
Svatopluk Poljak;Franz Rendl
Affiliations:
-;-
Venue:
Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Year:
1995

Citing 0
Cited 7

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
A Polyhedral Approach for Nonconvex Quadratic Programming Problemswith Box Constraints

Journal of Global Optimization
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Journal of Global Optimization
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
Maximum cut in fuzzy nature: Models and algorithms

Journal of Computational and Applied Mathematics
Mutation Hopfield neural network and its applications

Information Sciences: an International Journal
A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract