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 optimization problem over a matroid can be solved in polynomial time as well. We also solve these problems for intersections of strongly base orderable matroids.
['Asaf Levin', 'Shmuel Onn']
Shifted matroid optimization