Resource Allocation Problems

Naoki Katoh () and Toshihide Ibaraki ()
Additional contact information
Naoki Katoh: Kyoto University, Department of Architecture and Architectural Systems Graduate School of Engineering
Toshihide Ibaraki: Kyoto University, Department of Applied Mathematics and Physics Graduate School of Informatics

A chapter in Handbook of Combinatorial Optimization, 1998, pp 905-1006 from Springer

Abstract: Abstract The resource allocation problem seeks to find an optimal allocation of a fixed amount of resources to activities so as to minimize the cost incurred by the allocation. A simplest form of the problem is to minimize a separable convex function under a single constraint concerning the total amount of resources to be allocated. The amount of resources to be allocated to each activity is treated as a continuous or integer variable, depending on the cases. This can be viewed as a special case of the nonlinear programming problem or the nonlinear integer programming problem.

Keywords: Polynomial Time Algorithm; Resource Allocation Problem; Incremental Algorithm; Submodular Function; Operation Research Letter (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_14

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().