Solution techniques for some allocation problems
From MaRDI portal
Publication:3955156
DOI10.1007/BF02591716zbMath0492.90053MaRDI QIDQ3955156
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
approximation method; allocation problems; solution techniques; generalized upper bounds; convex knapsack problems; novel data structures
65K05: Numerical mathematical programming methods
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Determination of reorder points for spare parts in a two-echelon inventory system: The case of non identical maintenance facilities, Quadratic resource allocation with generalized upper bounds