Výsledky vyhledávání - "68Q25 (Theory of computing: Analysis of algorithms and problem complexity)"

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications.

Autoři: Iwamasa, Yuni Takazawa, Kenjiro

Zdroj: Mathematical Programming. Jul2022, Vol. 194 Issue 1/2, p229-256. 28p.

Témata: *MATROIDS, *COST functions, *COMBINATORIAL optimization, *MODULAR functions, *MATHEMATICAL programming, *CONVEX functions