scientific article; zbMATH DE number 558545
zbMATH Open0798.90110MaRDI QIDQ4289901FDOQ4289901
Authors: Vangelis Th. Paschos, Ferhan Pekergin, V. Zissimopoulos
Publication date: 19 May 1994
Title of this publication is not available (Why is that?)
Recommendations
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
- scientific article; zbMATH DE number 370481
- Boltzmann machines for travelling salesman problems
- Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
- Probabilistic optimization in graph-problems
- Approximate inference in Boltzmann machines
- Optimization on sparse random hypergraphs and spin glasses
- Approximating MAPs for belief networks is NP-hard and other theorems
maximum cliquemaximum independent setapproximated solutionsgreedy heuristicminimum vertex coverBoltzmann machine neural network model
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cited In (3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289901)