A constructive algorithm of neural approximation models for optimization problems

Author： Carcangiu Sara   Fanni Alessandra   Montisci Augusto  

Publisher： Emerald Group Publishing Ltd

ISSN： 0332-1649

Source： COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol.28, Iss.5, 2009-09, pp. : 1276-1289

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Hardness results for neural network approximation problems

By Bartlett P.L.   Ben-David S.  

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 53-66

Elsevier

Access to resources Recommend Favorite

An approximation algorithm for convex multi-objective programming problems

By Ehrgott Matthias  

Journal of Global Optimization, Vol. 50, Iss. 3, 2011-07 ,pp. : 397-416

Springer Publishing Company

Access to resources Recommend Favorite

Differential approximation algorithms for some combinatorial optimization problems

By Demange M.   Grisoni P.   Th. Paschos V.  

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 107-122

Elsevier

Access to resources Recommend Favorite

On initial populations of a genetic algorithm for continuous optimization problems

By Maaranen Heikki   Miettinen Kaisa   Penttinen Antti  

Journal of Global Optimization, Vol. 37, Iss. 3, 2007-03 ,pp. : 405-436

Springer Publishing Company

Access to resources Recommend Favorite

A Finite Algorithm for Solving Infinite Dimensional Optimization Problems

By Schochetman I.E.  

Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. : 119-142

Springer Publishing Company

Access to resources Recommend Favorite