|
Volumn 40, Issue 12, 1991, Pages 1413-1418
|
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems
a b c |
Author keywords
Approximation algorithms; Boltzmann machine; combinatorial optimization; consensus function; feasibility; heuristic; neural network; NP complete
|
Indexed keywords
MATHEMATICAL PROGRAMMING, LINEAR;
BOLTZMANN MACHINES;
COVERING PROBLEMS;
NP COMPLETE PROBLEMS;
PACKING PROBLEMS;
NEURAL NETWORKS;
|
EID: 0026367759
PISSN: 00189340
EISSN: None
Source Type: Journal
DOI: 10.1109/12.106226 Document Type: Article |
Times cited : (24)
|
References (11)
|