A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462): Difference between revisions

@@ Property / cites work @@
+On an optimization problem with nested constraints
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
+Normal rank
@@ Property / cites work @@
+The complexity of selection and ranking in X+Y and matrices with sorted columns
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization
@@ Property / cites work: Submodular functions and optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3935744
@@ Property / cites work: Q3935744 / rank @@
+Normal rank
@@ Property / cites work @@
+Two algorithms for maximizing a separable concave function over a polymatroid feasible region
+Normal rank
@@ Property / cites work @@
+Q4286721
@@ Property / cites work: Q4286721 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
+Normal rank