Pages that link to "Item:Q1179000"

The following pages link to Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000):

Displaying 30 items.

• Optimization and mechanism design (Q715235) (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• Priority classes and weighted constrained equal awards rules for the claims problem (Q893392) (← links)
• Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
• A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462) (← links)
• Minimization of an M-convex function (Q1392577) (← 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)
• Optimization problems with color-induced budget constraints (Q1631646) (← links)
• Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
• A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
• Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
• Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
• Equilibrium computation in resource allocation games (Q2149542) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• Submodular optimization views on the random assignment problem (Q2330658) (← links)
• Efficient, fair, and strategy-proof (re)allocation under network constraints (Q2362197) (← links)
• Submodular functions: from discrete to continuous domains (Q2414912) (← links)
• Minimum entropy orientations (Q2517793) (← links)
• Optimization Problems with Color-Induced Budget Constraints (Q2835676) (← links)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
• Active-set Methods for Submodular Minimization Problems (Q4637060) (← links)
• Convexity and Steinitz's exchange property (Q4645928) (← links)
• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
• On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
• Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
• A polynomial algorithm for resourse allocation problems with polymatroid constrains¹ (Q5689829) (← links)