Solving the assignment problem using continuous-time and discrete-time improved dual networks.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 24806130.
- Also identified by DOI 10.1109/TNNLS.2012.2187798.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
The assignment problem is an archetypal combinatorial optimization problem. In this brief, we present a continuous-time version and a discrete-time version of the improved dual neural network (IDNN) for solving the assignment problem. Compared with most assignment networks in the literature, the two versions of IDNNs are advantageous in circuit implementation due to their simple structures. Both of them are theoretically guaranteed to be globally convergent to a solution of the assignment problem if only the solution is unique.
Medical subject headings
- Algorithms
- Decision Support Techniques
- Neural Networks, Computer
- Pattern Recognition, Automated