Matroid optimization with the interleaving of two ordered sets

DOI10.1016/0166-218X(84)90077-5zbMath0539.05025MaRDI QIDQ793743

Dan Gusfield

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

weighted matroidoptimal matroid base

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (8)

On-line updating of solutions to a class of matroid intersection problems ⋮ Matroid optimization with generalized constraints ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Biobjective optimization problems on matroids with binary costs ⋮ An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint ⋮ Color constrained combinatorial optimization problems ⋮ Efficient solution of the matroid product problem ⋮ A multiply constrained matroid optimization problem

Cites Work

• Unnamed Item
• On Finding and Updating Spanning Trees and Shortest Paths
• A good algorithm for smallest spanning trees with a degree constraint

This page was built for publication: Matroid optimization with the interleaving of two ordered sets