Dynamical random neural network approach to a problem of optimal resource allocation

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dynamical Random Neural Network (DRNN) has been suggested as tools for the solution of optimization problems [1, 2]. Here DRNN method is applied to solve the problem of optimal resource allocation with both minimum and maximum activation levels and fixed cost. The problem is NP-hard. The conclusion shows that the DRNN method provides results of the optimal resource allocation problem better than those given by [3]. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zhong, Y., Sun, D., & Wu, J. (2005). Dynamical random neural network approach to a problem of optimal resource allocation. In Lecture Notes in Computer Science (Vol. 3512, pp. 1157–1163). Springer Verlag. https://doi.org/10.1007/11494669_142

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free