A constrained independent set problem for matroids

DOI10.1016/S0167-6377(03)00063-4zbMath1056.90101MaRDI QIDQ1433653

Satoru Iwata, Tamás Fleiner, András Frank

Publication date: 1 July 2004

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

zbMATH Keywords

Matroid intersectionMatroid parityMS matchings

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

Optimization problems with color-induced budget constraints ⋮ A constrained independent set problem for matroids ⋮ Optimization Problems with Color-Induced Budget Constraints

Cites Work

• Unnamed Item
• Unnamed Item
• A constrained independent set problem for matroids
• A constrained matching problem
• Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
• A Min-Max Theorem for a Constrained Matching Problem

This page was built for publication: A constrained independent set problem for matroids