Login / Signup
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.
Vassilis Zissimopoulos
Vangelis Th. Paschos
Ferhan Pekergin
Published in:
IEEE Trans. Computers (1991)
Keyphrases
</>
prior knowledge
dynamic programming
objective function
genetic algorithm
computational complexity
special case
linear programming
unsupervised learning
optimization algorithm
reinforcement learning
particle swarm optimization
heuristic search