A relaxation algorithm is presented for solving a class of combinatorial optimization problems called set-partitioning tasks. The convergence property of the presented algorithm is investigated theoretically. A performance guarantee is derived theoretically for the present algorithm applied to an NP-hard example problem called the maximum-cut graph partitioning. The experimental examination of its performance manifests its superiority in computational speed to the conventional gradient method.
|Number of pages||10|
|Journal||Journal of Circuits, Systems and Computers|
|Publication status||Published - 1996|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering