A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems

被引：2
|
作者：
Zaporozhets, A
机构：
[1] Dept. of Math. Problems in CAD, Belarus State University, 220080 Minsk
来源：
OPERATIONS RESEARCH LETTERS | 1997年 / 21卷 / 02期
关键词：
integer programming; resource allocation problem; greedy algorithm; polymatroid;
D O I：
10.1016/S0167-6377(97)00026-6
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The paper deals with the problem of maximizing a separable concave function over integer points of a polymatroid, known to be the integer case of the resource allocation problem. The Bottom Up algorithm for the case when the polymatroid is specified by an explicit list of constraints was presented by H. Groenevelt (European Journal of Operational Research 54 (1991) 227-236). We give a new proof of optimality of the Bottom Up algorithm. It is considerably shorter and simpler than the original proof. Our proof is based on the analysis of the greedy algorithm for this problem and properties of greedy solutions. (C) 1997 Elsevier Science B.V.
引用
收藏
页码：81 / 85
页数：5
相关论文
共 50 条
12345