Matroid optimization with the interleaving of two ordered sets

DOI10.1016/0166-218X(84)90077-5MaRDI QIDQ793743zbMATH OpenFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 140090
• On matroids with multiple objectives
• A new exchange property for matroids and its application to max-min-problems
• scientific article; zbMATH DE number 3904604
• scientific article; zbMATH DE number 4066909

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A good algorithm for smallest spanning trees with a degree constraint
• On Finding and Updating Spanning Trees and Shortest Paths

Cited in

(11)

• On-line updating of solutions to a class of matroid intersection problems
• A new exchange property for matroids and its application to max-min-problems
• A multiply constrained matroid optimization problem
• Matroid optimization with generalized constraints
• An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Color constrained combinatorial optimization problems
• scientific article; zbMATH DE number 140090 (Why is no real title available?)
• Biobjective optimization problems on matroids with binary costs
• Efficient solution of the matroid product problem

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

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