Presentation | 1996/3/18 Neural Representation of Combinatorial Optimization Problems Sharply Distinguishing Optimal Solutions Satoshi Matsuda, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Taking assignment problem as an example of combinatorial optimization problems, its neural representation is presented where asymptotically stable corners of state hypercube of the network are always optimal solutions. That is, one can always get optimal solution whenever the network converges to a corner. By simulations it is shown that optimal solutions are obtained very frequently. This representation is possible for many combinatorial optimization problems as well as assignment problems. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Hopfield network / combinatorial optimization problem / optimal neural representation |
Paper # | NC-95-117 |
Date of Issue |
Conference Information | |
Committee | NC |
---|---|
Conference Date | 1996/3/18(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Neurocomputing (NC) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Neural Representation of Combinatorial Optimization Problems Sharply Distinguishing Optimal Solutions |
Sub Title (in English) | |
Keyword(1) | Hopfield network |
Keyword(2) | combinatorial optimization problem |
Keyword(3) | optimal neural representation |
1st Author's Name | Satoshi Matsuda |
1st Author's Affiliation | Computer and Communication Research Center, Tokyo Electric Power Company() |
Date | 1996/3/18 |
Paper # | NC-95-117 |
Volume (vol) | vol.95 |
Number (no) | 598 |
Page | pp.pp.- |
#Pages | 8 |
Date of Issue |