Lexicographic Matroid Optimization
نویسندگان
چکیده
We show that finding lexicographically minimal n bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted problem over a matroid can be solved in polynomial time as well.
منابع مشابه
A new strategy for push-relabel algorithm framework for matroid optimization
In this paper we present a combinatorial push-relabel algorithm based on lowest level/bfs traversal for matroid optimization. In contrast with other known algorithms our procedure uses lowest level rule and needs no lexicographic order of the elements. Combined with a reduction of the number of active basis our strategy gives a time complexity of O(n).
متن کاملSimple Push-relabel Algorithms for Matroids and Submodular Flows
We derive simple push-relabel algorithms for the matroid partitioning, matroid membership, and submodular flow feasibility problems. It turns out that, in order to have a strongly polynomial algorithm, the lexicographic rule used in all previous algorithms for the two latter problems can be avoided. Its proper role is that it helps speeding up the algorithm in the last problem.
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملA lexicographic shellability characterization of geometric lattices
Geometric lattices are characterized as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are shown to be exactly those finite lattices such that every ordering on the join-irreducibles induces a lexicographic shelling. This new characterization fits into a similar ...
متن کاملThe Base-matroid and Inverse Combinatorial Optimization Problems
A new matroid is introduced: this matroid is de0ned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the 0eld of inverse combinatorial optimization problems. We discuss in detail the LP fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.00447 شماره
صفحات -
تاریخ انتشار 2015