Persistency and matroid intersection

DOI10.1007/S10287-007-0064-XzbMATH Open1190.90167OpenAlexW2010325929MaRDI QIDQ1035281FDOQ1035281

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

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

zbMATH Keywords

matroid intersectionindependence systempersistency partition

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• 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)