The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
From MaRDI portal
Publication:3757688
DOI10.1287/opre.34.6.909zbMath0619.90051OpenAlexW2072492565MaRDI QIDQ3757688
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a25eb282df31ef4067fd33d8853fdbaca4c758cc
Related Items
Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center., Algorithms for separable convex optimization with linear ascending constraints, Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions, 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?, A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints, The effect of cancelled appointments on outpatient clinic operations, Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, An auxiliary function method for global minimization in integer programming, Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids, Theory of Principal Partitions Revisited, Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., A polynomial algorithm for resourse allocation problems with polymatroid constrains1, A greedy algorithm for solving ordinary transportation problem with capacity constraints, 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 faster algorithm for the resource allocation problem with convex cost functions, Complexity and algorithms for nonlinear optimization problems, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Some specially structured assemble-to-order systems, A Decomposition Algorithm for Nested Resource Allocation Problems, Power control and capacity of spread spectrum wireless networks, The nestedness property of the convex ordered median location problem on a tree, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications
