scientific article; zbMATH DE number 558545

zbMATHMaRDI QIDQ4289901FDO

Authors Vangelis Th. Paschos, Ferhan Pekergin, V. Zissimopoulos

Publication date 19 May 1994

zbMATH Keywords

maximum cliquemaximum independent setapproximated solutionsgreedy heuristicminimum vertex coverBoltzmann machine neural network model

Mathematics Subject Classification ID

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)

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

Cited in

(4)

• Clustered Boltzmann machines: Massively parallel architectures for constrained optimization problems
• Metaheuristics: A bibliography
• A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem
• Graph clustering with Boltzmann machines

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)