Efficient solution of the matroid product problem

DOI10.1016/0167-6377(89)90050-3MaRDI QIDQ2314409zbMATH OpenOpenAlexFDO

Authors Dan Gusfield

Publication date 22 July 2019

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(89)90050-3

zbMATH Keywords

combinatorial optimizationmatroid pairing theoremmatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial optimization (90C27)

Recommendations

• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
• On a discrete optimization problem
• Convex Matroid Optimization
• On matroids with multiple objectives
• Efficient theoretic and practical algorithms for linear matroid intersection problems

Cites work

• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
• Efficient algorithms for a family of matroid intersection problems
• Matroid optimization with the interleaving of two ordered sets
• On-line updating of solutions to a class of matroid intersection problems

Cited in

(1)

• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements

This page was built for publication: Efficient solution of the matroid product problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314409)