Submodular linear programs on forests
نویسندگان
چکیده
A general linear programming model for an order-theoretic analysis of both Edmonds' ~eedy algorithm for matroids and the NW-comer rule for transportation problems with Monge costs is introduced. This approach includes the model of Queyranne, Spieksma and Tardella (1993) as a special case. We solve the problem by optimal greedy algorithms for rooted forests as underlying structures. Other solvable cases are also discussed.
منابع مشابه
A general class of greedily solvable linear programs
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated to the elements of a sublattice B of a finite product lattice, and the cost coefficients define a submodular function on B . This approach links and generalizes two well-known classes of greedily solvable linear programs. The primal problem generalizes the (ordinary and multiindex) transportation ...
متن کاملordered sets , and submodular functions
Recent developments in the use of greedy algorithms in linear programming are reviewed and extended. We find a common generalization of some theorems of Queyranne–Spieksma– Tardella, Faigle–Kern, and Fujishige about greedy algorithms for linear programs in diverse contexts. Additionally, we extend a well-known theorem of Topkis about submodular functions on the product of chains to submodular f...
متن کاملOn k-Column Sparse Packing Programs
We consider the class of packing integer programs (PIPs) that are column sparse, where there is a specified upper bound k on the number of constraints that each variable appears in. We give an improved (ek + o(k))-approximation algorithm for k-column sparse PIPs. Our algorithm is based on a linear programming relaxation, and involves randomized rounding combined with alteration. We also show th...
متن کاملGuarantees for Greedy Maximization of Non-submodular Functions with Applications
We investigate the performance of the GREEDY algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of GREEDY for maximizing submodular functions, there are few guarantees for non-submodular ones. However, GREEDY enjoys strong empirical performance for many important non-submodular functi...
متن کاملForthcoming in Mathematical Programming MAXIMIZING A CLASS OF SUBMODULAR UTILITY FUNCTIONS
Given a finite ground set N and a value vector a ∈ R , we consider optimization problems involving maximization of a submodular set utility function of the form h(S) = f (∑ i∈S ai ) , S ⊆ N , where f is a strictly concave, increasing, differentiable function. This function appears frequently in combinatorial optimization problems when modeling risk aversion and decreasing marginal preferences, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 72 شماره
صفحات -
تاریخ انتشار 1996