Constrained neural approaches to quadratic assignment problems.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 12662776.
- 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
In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.