A constrained independent set problem for matroids

DOI10.1016/S0167-6377(03)00063-4MaRDI QIDQ1433653zbMATH OpenFDO

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

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)

Recommendations

• On the cardinality constrained matroid polytope
• On the independence numbers of a matroid
• A multiply constrained matroid optimization problem
• scientific article; zbMATH DE number 3858856
• Constrained matroidal bottleneck problems
• Constraints on the number of maximal independent sets in graphs
• Independent sets with domination constraints
• scientific article; zbMATH DE number 1223713
• A note on independence systems and matroids
• scientific article; zbMATH DE number 1086854

Cites work

• scientific article; zbMATH DE number 3750968 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A Min-Max Theorem for a Constrained Matching Problem
• A constrained independent set problem for matroids
• A constrained matching problem
• Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports

Cited in

(4)

• Optimization problems with color-induced budget constraints
• Optimization problems with color-induced budget constraints
• A constrained independent set problem for matroids
• Generalized matroid matching

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

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