A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization

Kiichi Urahama

Research output: Contribution to journalArticlepeer-review


Using a neural net composed of subnets with a winner‐take‐all (WTA) mode of operations, the constraint that the variables must form a probability vector or a probability matrix can automatically be satisfied. Taking advantage of this property, this paper proposes a neural algorithm than can derive the approximate solution for a combinatorial optimization problem such as set partitioning. As a simple example, the 3‐partition maximum‐cut problem is considered. The worst‐case error is evaluated theoretically, and it is shown that the proposed method is one‐third (relative) approximate algorithm. For comparison, the performance of the conventional method also is evaluated theoretically. The performances also are compared by experiment. Both the theoretical and experimental results confirm that the proposed method can achieve better performance than the conventional method.

Original languageEnglish
Pages (from-to)93-100
Number of pages8
JournalSystems and Computers in Japan
Issue number6
Publication statusPublished - Jan 1 1993
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization'. Together they form a unique fingerprint.

Cite this