On the performance guarantee of neural networks for NP-hard optimization problems

DOI10.1016/0020-0190(95)00051-DzbMath0875.68552MaRDI QIDQ672967

Vassilios Zissimopoulos

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Neural networksHeuristicsCombinatorial optimizationApproximation algorithmsAnalysis of algorithmsCombinatorial problemsMaximum independent setWorst-case analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• On the power of neural networks for solving hard problems
• Finding approximate solutions to NP-hard problems by neural networks is hard
• A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem

This page was built for publication: On the performance guarantee of neural networks for NP-hard optimization problems