Persistency and matroid intersection

DOI10.1007/s10287-007-0064-xzbMath1190.90167OpenAlexW2010325929MaRDI QIDQ1035281

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

independence systemmatroid intersectionpersistency partition

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Persistency in the assignment and transportation problems
• Persistency in maximum cardinality bipartite matchings
• Characterizing matchings as the intersection of matroids
• Matroid Representation of Clique Complexes
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• A weighted matroid intersection algorithm
• Vertices Belonging to All or to No Maximum Stable Sets of a Graph
• Combinatorial optimization. Theory and algorithms.
• Persistency in combinatorial optimization problems on matroids

This page was built for publication: Persistency and matroid intersection