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

DOI10.1109/12.106226zbMATH Open1395.68243OpenAlexW2166072897MaRDI QIDQ5375431FDOQ5375431

Authors: Vangelis Th. Paschos, Ferhan Pekergin, V. 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)

Cited In (5)

• Title not available (Why is that?)
• 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
• A parallel algorithm for the minimum weighted vertex cover problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375431)