The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
From MaRDI portal
Publication:3757688
DOI10.1287/opre.34.6.909zbMath0619.90051MaRDI QIDQ3757688
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a25eb282df31ef4067fd33d8853fdbaca4c758cc
90C10: Integer programming
Related Items
A polynomial algorithm for resourse allocation problems with polymatroid constrains1, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, An algorithm for the fair resource allocation problem with a submodular constraint, A short proof of optimality of the bottom up algorithm for discrete resource allocation problems, Optimization under ordinal scales: When is a greedy solution optimal?, Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., Power control and capacity of spread spectrum wireless networks, Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center.