The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
From MaRDI portal
Publication:3757688
DOI10.1287/OPRE.34.6.909zbMATH Open0619.90051OpenAlexW2072492565MaRDI QIDQ3757688FDOQ3757688
Authors: Awi Federgruen, H. Groenevelt 
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a25eb282df31ef4067fd33d8853fdbaca4c758cc
Recommendations
- A polynomial algorithm for resourse allocation problems with polymatroid constrains1
- A short proof of optimality of the bottom up algorithm for discrete resource allocation problems
- Asignacion de recuerdos max-min: Propiedades y algoritmos
- A greedy algorithm for some classes of integer programs.
- scientific article; zbMATH DE number 3845343
Cited In (26)
- Complexity and algorithms for nonlinear optimization problems
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- A greedy algorithm for solving ordinary transportation problem with capacity constraints
- An auxiliary function method for global minimization in integer programming
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- The nestedness property of the convex ordered median location problem on a tree
- Algorithms for separable convex optimization with linear ascending constraints
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- A decomposition algorithm for nested resource allocation problems
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
- Some specially structured assemble-to-order systems
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center.
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
- An algorithm for the fair resource allocation problem with a submodular constraint
- Power control and capacity of spread spectrum wireless networks
- The effect of cancelled appointments on outpatient clinic operations
- A faster algorithm for the resource allocation problem with convex cost functions
- Theory of Principal Partitions Revisited
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
- Decreasing minimization on M-convex sets: background and structures
- 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 polynomial algorithm for resourse allocation problems with polymatroid constrains1
- Decreasing minimization on M-convex sets: algorithms and applications
This page was built for publication: The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757688)
