On the performance guarantee of neural networks for NP-hard optimization problems (Q672967): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3994799 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of neural networks for solving hard problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding approximate solutions to NP-hard problems by neural networks is hard / rank | |||
Normal rank | |||
Latest revision as of 10:21, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the performance guarantee of neural networks for NP-hard optimization problems |
scientific article |
Statements
On the performance guarantee of neural networks for NP-hard optimization problems (English)
0 references
28 February 1997
0 references
Combinatorial problems
0 references
Analysis of algorithms
0 references
Combinatorial optimization
0 references
Neural networks
0 references
Maximum independent set
0 references
Heuristics
0 references
Approximation algorithms
0 references
Worst-case analysis
0 references
