A multiply constrained matroid optimization problem

DOI10.1016/0012-365X(88)90149-5zbMath0684.90072MaRDI QIDQ1825757

Yanyan Li

Publication date: 1989

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

zbMATH Keywords

matroidminimum spanning treeminimum cost basisminimum cost schedulemulti-color matroid optimization problempreprocessing phase

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Matroid optimization with generalized constraints ⋮ k-Best constrained bases of a matroid ⋮ Biobjective optimization problems on matroids with binary costs ⋮ Color constrained combinatorial optimization problems ⋮ Constrained spanning trees and the traveling salesman problem

Cites Work

• Matroid optimization with the interleaving of two ordered sets
• Efficient algorithms for a family of matroid intersection problems
• A weighted matroid intersection algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item