Persistency and matroid intersection

DOI10.1007/S10287-007-0064-XMaRDI QIDQ1035281zbMATH OpenOpenAlexFDO

Authors J. Blot

Publication date 2 November 2009

Published in Computational Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10287-007-0064-x

zbMATH Keywords

matroid intersectionindependence systempersistency partition

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Persistency in combinatorial optimization problems on matroids
• scientific article; zbMATH DE number 426335
• scientific article; zbMATH DE number 3904605
• scientific article; zbMATH DE number 123444
• Robust matchings and matroid intersections

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• A weighted matroid intersection algorithm
• Characterizing matchings as the intersection of matroids
• Combinatorial optimization. Theory and algorithms.
• Matroid representation of clique complexes
• Persistency in combinatorial optimization problems on matroids
• Persistency in maximum cardinality bipartite matchings
• Persistency in the assignment and transportation problems
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Vertices Belonging to All or to No Maximum Stable Sets of a Graph

Cited in

(3)

• scientific article; zbMATH DE number 20942 (Why is no real title available?)
• Persistency in combinatorial optimization problems on matroids
• Preservation of persistence and stability under intersections and operations. I: Persistence

This page was built for publication: Persistency and matroid intersection

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