A short proof of optimality of the bottom up algorithm for discrete resource allocation problems
From MaRDI portal
(Redirected from Publication:1373462)
Recommendations
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- A polynomial algorithm for resourse allocation problems with polymatroid constrains1
- scientific article; zbMATH DE number 3845343
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
Cites work
- scientific article; zbMATH DE number 3751684 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- On an optimization problem with nested constraints
- Submodular functions and optimization
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
Cited in
(2)
This page was built for publication: A short proof of optimality of the bottom up algorithm for discrete resource allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373462)
