scientific article; zbMATH DE number 4066656

MaRDI QIDQ3799841zbMATH OpenFDO

Authors Carsten Peterson, James R. Anderson

Publication date 1988

zbMATH Keywords

approximate solutionsmean field theoryminimum cut graph bisection problemneural network techniqueNP-completeparallel method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)

Recommendations

• On the performance guarantee of neural networks for NP-hard optimization problems
• Neural networks for NP-complete problems
• Neural network methods in combinatorial optimization
• scientific article; zbMATH DE number 4201664
• Neural networks and combinatorial optimization
• NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM
• Neural networks for solving generalized nonlinear complementarity problems
• Neural Computing for Optimization and Combinatorics
• Neural networks for nonlinear and mixed complementarity problems and their applications

Cited in

(10)

• Automata networks and optimization
• Neural network methods in combinatorial optimization
• Comparison of neural and heuristic methods for a timetabling problem
• Some personal views on the current state and the future of locational analysis
• Simulated annealing: Practice versus theory
• Metaheuristics: A bibliography
• Stochastic multivalued network for optimization. Application to the Graph MaxCut problem
• scientific article; zbMATH DE number 1357957 (Why is no real title available?)
• On the Hopfield neural networks and mean field theory
• An ODE approach to multiple choice polynomial programming

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 Q3799841)