Matroid bases with cardinality constraints on the intersection

DOI10.1007/s10107-021-01642-1zbMath1494.90097arXiv1907.04741OpenAlexW3147430137MaRDI QIDQ2149563

Britta Peis, Veerle Timmermans, Stefan Lendl

Publication date: 29 June 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.04741

zbMATH Keywords

matroidsrobust optimizationpolymatroidsintersection constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The optimal path-matching problem
• Discrete convex analysis
• Combinatorial optimization with interaction costs: complexity and solvable cases
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Recoverable robust spanning tree problem under interval uncertainty representations
• Submodular functions and optimization.
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
• A weighted matroid intersection algorithm
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• Valuated Matroid Intersection I: Optimality Criteria
• Valuated Matroid Intersection II: Algorithms
• Combinatorial optimization. Theory and algorithms
• Approximate multi-matroid intersection via iterative refinement