Results 1  10
of
294,499
Maxcut Problem
, 2007
"... Maxcut problem is one of many NPhard graph theory problems which attracted many researchers over the years. Though there is almost no hope in finding a polynomialtime algorithm for maxcut problem, various heuristics, or combination of optimization and heuristic methods have been developed to solv ..."
Abstract
 Add to MetaCart
Maxcut problem is one of many NPhard graph theory problems which attracted many researchers over the years. Though there is almost no hope in finding a polynomialtime algorithm for maxcut problem, various heuristics, or combination of optimization and heuristic methods have been developed
An Investigation of the MaxCut Problem
, 2004
"... The MaxCut problem seeks to partition the vertices of a graph into two sets such that the weight of the edges joining those sets is maximized. The MaxCut problem has been of continued research interest and has developed an extensive literature. After reviewing of a small portion of that literature, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The MaxCut problem seeks to partition the vertices of a graph into two sets such that the weight of the edges joining those sets is maximized. The MaxCut problem has been of continued research interest and has developed an extensive literature. After reviewing of a small portion of that literature
Approximation Algorithm for the MaxCut Problem
 Combinatorics, Probability and Computing
, 1993
"... In this project, we investigated several approximation algorithms for the MaxCut problem. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this project, we investigated several approximation algorithms for the MaxCut problem.
Randomized Heuristics for the MaxCut Problem
 Optimization Methods and Software
, 2002
"... Given an undirected graph with edge weights, the MAXCUT 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. ..."
Abstract

Cited by 40 (17 self)
 Add to MetaCart
Given an undirected graph with edge weights, the MAXCUT 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.
A Continuation Algorithm for MaxCut Problem
"... Abstract A continuation algorithm for the solution of maxcut problems is proposed in this paper. Unlike the available semidefinite relaxation, a maxcut problem is converted into a continuous nonlinear programming by employing NCP functions, and the resulting nonlinear programming problem is then ..."
Abstract
 Add to MetaCart
Abstract A continuation algorithm for the solution of maxcut problems is proposed in this paper. Unlike the available semidefinite relaxation, a maxcut problem is converted into a continuous nonlinear programming by employing NCP functions, and the resulting nonlinear programming problem
Complexity Results for the Gap Inequalities for the MaxCut Problem
, 2011
"... In 1996, Laurent and Poljak introduced an extremely general class of cutting planes for the maxcut problem, called gap inequalities. We prove several results about them, including the following: (i) there must exist nondominated gap inequalities with gap larger than 1, unless ..."
Abstract
 Add to MetaCart
In 1996, Laurent and Poljak introduced an extremely general class of cutting planes for the maxcut problem, called gap inequalities. We prove several results about them, including the following: (i) there must exist nondominated gap inequalities with gap larger than 1, unless
A cutting plane algorithm for the maxcut problem
 Optimization Methods and Software
, 1994
"... This work was partially supported by EEC Contract SC1CT910620. In this paper we describe a cutting plane algorithm to solve maxcut problems on complete graphs. We show that the separation problem over the cut polytope can be reduced to the separation problem over the cut cone and we give a sepa ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
This work was partially supported by EEC Contract SC1CT910620. In this paper we describe a cutting plane algorithm to solve maxcut problems on complete graphs. We show that the separation problem over the cut polytope can be reduced to the separation problem over the cut cone and we give a
Advanced Scatter Search for the MaxCut Problem
"... The MaxCut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights between both sets is maximized. This is an NPhard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
The MaxCut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights between both sets is maximized. This is an NPhard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed
Strengthened Semidefinite Programming Relaxations for the MAXCUT Problem
"... In this paper we summarize recent results on finding tight semidefinite programming relaxations for the MaxCut problem and hence tight upper bounds on its optimal value. Our results hold for every instance of MaxCut and in particular we make no assumptions on the edge weights. We present two stren ..."
Abstract
 Add to MetaCart
In this paper we summarize recent results on finding tight semidefinite programming relaxations for the MaxCut problem and hence tight upper bounds on its optimal value. Our results hold for every instance of MaxCut and in particular we make no assumptions on the edge weights. We present two
On Greedy Construction Heuristics for the MaxCut Problem
 INTERNATIONAL JOURNAL ON COMPUTATONAL SCIENCE AND ENGINEERING
, 2007
"... Given a graph with nonnegative edge weights, the MAXCUT problem is to partition the set of vertices into two subsets so that the sum of the weights of edges with endpoints in di#erent subsets is maximized. This classical NPhard problem finds applications in VLSI design, statistical physics, an ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
, and classification among other fields. This paper compares the performance of several greedy construction heuristics for MAXCUT problem. In particular, a new "worstout" approach is studied and the proposed edge contraction heuristic is shown to have an approximation ratio of at least 1/3. The results
Results 1  10
of
294,499