Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. It is a well-known NP-hard problem with applications in several ...
1.1 Max-cut Problem A cut in a weighted undirected graph Gw = (V, E ), is de?ned as partition of the vertices of G into two sets; and the weight of a cut is the summation of weights of the edges that has an end point in each set (i.e. the edges that connect vertices of ...
The suggested changes are not particular to the max-cut problem and could be considered for future applications to other combinatorial optimization problems.关键词: Combinatorial optimization Metaheuristics Max-cut problem Local search Cross-entropy ...
This problem can also be phrased as a weighted MAX-CUT problem. The performance of MAX-CUT heuristics in this application is untested. We present a greedy heuristic solution to the contig orientation problem and compare its performance to a weighted MAX-CUT semi-definite programming heuristic ...
Two stochastic optimization methods: Cross Entropy (CE) and Parametric Minimum Cross Entropy (PME) were tested against Large Max-Cut problems. The problems were taken from the "The DIMACS Library of Mixed Semidefinite-Quadratic-Linear Programs" challenge web site. The two methods achieved close and...
The max-cut problem has long been known to be NP-complete [20], even for any un-weighted graphs [12], and has applications in circuit layout design and statistical physics [3]. Approximate algorithms, such as ρ-approximation algorithm [16], heuristic algorithms [9] and continuous algorithms...
The dual of the well-known SDP relaxation of maxcut is formul... K Krishnan,JE Mitchell - 《Computational Optimization & Applications》 被引量: 114发表: 2006年 A randomized approximation scheme for metric MAX-CUT Metric MAX-CUT is the problem of dividing a set of points in metric space ...
In VLSI physical design, many algorithms require the solution of difficult combinatorial optimization problems such as max/min-cut, max-flow problems etc. Due to the vast number of elements typically found in this problem domain, these problems are computationally intractable leading to the use of ...
Given an undirected graph with edge weights, the max-cut problem is to find a partition of the vertices into two subsets, such that the sum of the weights of the edges crossing different subsets is maximized. Heuristics based on auxiliary function can obtain high-quality solutions of the max...
We describe a branch and cut algorithm for both MAX-SAT and weighted MAX-SAT. This algorithm uses the GSAT procedure as a primal heuristic. At each nodewe ... S Joy,J Mitchell,B Borchers - Satisfiability Problem: Theory & Applications, 35 of Dimacs Series on Discrete Mathematics & Theoreti...