Pages that link to "Item:Q3757688"

The following pages link to The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality (Q3757688):

Displaying 23 items.

• An auxiliary function method for global minimization in integer programming (Q410370) (← links)
• A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
• The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
• Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
• An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
• A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462) (← links)
• Optimization under ordinal scales: When is a greedy solution optimal? (Q1374691) (← links)
• Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
• A greedy algorithm for solving ordinary transportation problem with capacity constraints (Q1728270) (← links)
• Some specially structured assemble-to-order systems (Q1785487) (← links)
• Power control and capacity of spread spectrum wireless networks (Q1818697) (← links)
• Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center. (Q1872998) (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• The effect of cancelled appointments on outpatient clinic operations (Q2178113) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• A Decomposition Algorithm for Nested Resource Allocation Problems (Q2810553) (← links)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
• Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)