An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
This paper is devoted to a generalization to matroids of the problem of finding a spanning tree in an edge-weighted connected graph that maximizes the product of the weights of edges, where negative edge weights are allowed. As the main result, a polynomial time algorithm for the solution of this problem in the context of matroids is described.
scientific article; zbMATH DE number 3931031