A polynomial algorithm for resourse allocation problems with polymatroid constrains1

DOI10.1080/02331939608844198zbMath0867.90081OpenAlexW2033932126MaRDI QIDQ5689829

No author found.

Publication date: 17 August 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844198

zbMATH Keywords

separable concave functiondichotomic greedy algorithmgeneralized symmetric polymatroids

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items (4)

Algorithms for separable convex optimization with linear ascending constraints ⋮ Mathematical model and optimization in global production problems. ⋮ Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. ⋮ Optimization in production quota problem with convex cost function

Cites Work

• On an optimization problem with nested constraints
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial algorithm for resourse allocation problems with polymatroid constrains¹