IJPAM: Volume 54, No. 3 (2009)

METHODS AND ALGORITHMS FOR SOLVING
THE RESOURCE ALLOCATION PROBLEM

Won-Joo Hwang$^1$, R. Enkhbat$^2$, A. Bayarbaatar$^3$
$^1$School of Electronics and Telecommunication Engineering
Inje University
607, Obang-Dong, Gimhae, Gyungnam, 621-749, KOREA
e-mail: [email protected]
$^{2,3}$School of Mathematics and Computer Science
National University of Mongolia
Ulaanbaatar, MONGOLIA


Abstract.We are concerned with the resource allocation problem which has many applications and is known as NP-hard problem. We show that the resource allocation problem can be solved efficiently by the methods such as the incremental algorithm, and branch and bound depending on the structure of the problem. Special attention will be paid to the resource allocation problem with a separable objective function which reduces to the discrete one. Computational experiments are provided.

Received: June 5, 2009

AMS Subject Classification: 46N10, 65K05

Key Words and Phrases: resource allocation problem, Lipschitz continuity, incremental algorithm, dynamic programming, branch and bound method

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2009
Volume: 54
Issue: 3