The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality

Recommendations

A polynomial algorithm for resourse allocation problems with polymatroid constrains¹
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

(28)

A polynomial algorithm for resourse allocation problems with polymatroid constrains¹
Complexity and algorithms for nonlinear optimization problems
A greedy algorithm for solving ordinary transportation problem with capacity constraints
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
Continuity and monotonicity of solutions to a greedy maximization problem
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
Sensitivity analysis for convex separable optimization over integral polymatroids
Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
Some specially structured assemble-to-order systems
Theory of principal partitions revisited
Sufficient conditions for the optimality of the greedy algorithm in greedoids
Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center.
An algorithm for the fair resource allocation problem with a submodular constraint
Discrete effort distribution via regret-enabled greedy algorithm
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
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?
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)