Neural networks for NP-complete problems

DOI10.1016/S0362-546X(97)00308-8zbMATH Open0894.90148MaRDI QIDQ4377229FDOQ4377229

Authors: Marco Budinich 

Publication date: 7 September 1998

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Recommendations

• On the power of neural networks for solving hard problems
• Neural network methods in combinatorial optimization
• Finding approximate solutions to NP-hard problems by neural networks is hard
• On problem solving with Hopfield neural networks

zbMATH Keywords

approximate solutionsneural networksNP-complete problems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Self-organization and associative memory
• The maximum clique problem
• Maxima for Graphs and a New Proof of a Theorem of Turán
• ``Neural computation of decisions in optimization problems
• Evolution towards the maximum clique
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
• A study of the application of Kohonen-type neural networks to the travelling salesman problem

Cited In (14)

• On the power of neural networks for solving hard problems
• Finding approximate solutions to NP-hard problems by neural networks is hard
• Comparing problem solving strategies for NP-hard optimization problems
• Neural network methods in combinatorial optimization
• Existence and stability of equilibria of the continuous-time Hopfield neural network
• ``Neural computation of decisions in optimization problems
• Finite-time synchronization of coupled Cohen-Grossberg neural networks with and without coupling delays
• Turing computability with neural nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• DIMACS

This page was built for publication: Neural networks for NP-complete problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377229)