A multiple penalty function method for solving max-bisection problems (Q2489432): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Feng-Min Xu / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Cheng-Xian Xu / rank | |||
Normal rank |
Revision as of 18:26, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A multiple penalty function method for solving max-bisection problems |
scientific article |
Statements
A multiple penalty function method for solving max-bisection problems (English)
0 references
28 April 2006
0 references
The authors study the max-bisection problem, defined as the problem of dividing the vertices of a given graph into two sets of equal cardinality such that the induced cut is of maximum edge weight. In the first section they introduce the above problem using binary decision variables, while in the second section a novel nonlinear continuous reformulation of the max-bisection problem is presented. The last two sections of this very interesting article concentrate on algorithmic aspects of the formulation such as multiple penalty functions and the results of numerical experimentation.
0 references
max-bisection problem
0 references
multiple penalty functions
0 references
circuit partitioning problem
0 references
semidefinite programming
0 references
numerical examples
0 references