Efficient resource allocation with non-concave objective functions 2001 (English)In: Computational Optimization and Applications, ISSN 0926-6003, Vol. 20, no 3, p. 281-298Article in journal (Refereed) Published

Abstract [en]

We consider resource allocation with separable objective functions defined over subranges of the integers. While it is well known that (the maximization version of) this problem can be solved efficiently if the objective functions are concave, the general

Place, publisher, year, edition, pages

2001. Vol. 20, no 3, p. 281-298

Identifiers

URN: urn:nbn:se:uu:diva-36480OAI: oai:DiVA.org:uu-36480DiVA, id: diva2:64379

Note

Addresses: Andersson A, Uppsala Univ, Dept Comp Sci, Box 311, SE-75105 Uppsala, Sweden. Uppsala Univ, Dept Comp Sci, SE-75105 Uppsala, Sweden. EnerSearch AB, SE-41288 Gothenburg, Sweden.Available from: 2007-02-13 Created: 2007-02-13 Last updated: 2011-01-13

Open Access in DiVA

No full text in DiVA

Authority records BETA

Andersson, Arne

Search in DiVA

By author/editor

Andersson, Arne

By organisation

Department of Information TechnologyComputing Science

Search outside of DiVA

GoogleGoogle ScholarTotal: 805 hits