On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems

DOI10.1109/12.106226zbMath1395.68243OpenAlexW2166072897MaRDI QIDQ5375431

Ferhan Pekergin, Vangelis Th. Paschos, Vassilios Zissimopoulos

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.106226

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (4)

A parallel algorithm for the minimum weighted vertex cover problem ⋮ Neural networks as systems for recognizing patterns ⋮ A neural network for the minimum set covering problem ⋮ Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing

This page was built for publication: On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems