On the performance guarantee of neural networks for NP-hard optimization problems
type: Item
instance of: scholarly article
title: On the performance guarantee of neural networks for NP-hard optimization problems
zbMATH Open document ID: 0875.68552
DOI: 10.1016/0020-0190(95)00051-D
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 985290
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Neural networks
zbMATH Keywords: Maximum independent set
zbMATH Keywords: Heuristics
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Worst-case analysis
author: V. Zissimopoulos
MaRDI profile type: Publication
cites work: Q3994799
cites work: On the power of neural networks for solving hard problems
cites work: A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
cites work: Finding approximate solutions to NP-hard problems by neural networks is hard
description: scientific article; zbMATH DE number 985290