### 抜粋

A novel computational model for large-scale maximum clique problems is proposed and tested. The maximum clique problem is first formulated as an unconstrained quadratic zero-one programming and it is solved by minimizing the weight summation over the same partition in a newly constructed graph. The proposed maximum neural network has the following advantages: (1) coefficient-parameter tuning in the motion equation is not required in the maximum neural network while the conventional neural networks suffer from it; (2) the equilibrium state of the maximum neural network is clearly defined in order to terminate the algorithm, while the existing neural networks do not have the clear definition; and (3) the maximum neural network always allows the state of the system to converge to the feasible solution, while the existing neural networks cannot guarantee it. The proposed parallel algorithm for large-size problems outperforms the best known algorithms in terms of computation time with much the same solution quality where the conventional branch-and-bound method cannot be used due to the exponentially increasing computation time.

元の言語 | English |
---|---|

ホスト出版物のタイトル | 91 IEEE Int Jt Conf Neural Networks IJCNN 91 |

出版者 | Publ by IEEE |

ページ | 905-910 |

ページ数 | 6 |

ISBN（印刷物） | 0780302273 |

出版物ステータス | Published - 1991 12 1 |

外部発表 | Yes |

イベント | 1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 - Singapore, Singapore 継続期間: 1991 11 18 → 1991 11 21 |

### 出版物シリーズ

名前 | 91 IEEE Int Jt Conf Neural Networks IJCNN 91 |
---|

### Other

Other | 1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 |
---|---|

市 | Singapore, Singapore |

期間 | 91/11/18 → 91/11/21 |

### ASJC Scopus subject areas

- Engineering(all)

## フィンガープリント A parallel neural network computing for the maximum clique problem' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*91 IEEE Int Jt Conf Neural Networks IJCNN 91*(pp. 905-910). (91 IEEE Int Jt Conf Neural Networks IJCNN 91). Publ by IEEE.