Inverse problems of matroid intersection

DOI10.1023/A:1009883605691MaRDI QIDQ1970339zbMATH OpenOpenAlexFDO

Authors Mao-Cheng Cai

Publication date 19 March 2000

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009883605691

zbMATH Keywords

inverse problemmatroid intersectionminimum cost circulationstrongly polynomial algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Inverse matroid intersection problem
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections
• The base-matroid and inverse combinatorial optimization problems.
• Inverse polymatroidal flow problem
• Inverse optimization problems with multiple weight functions

Cited in

(9)

• Inverse matroid intersection problem
• The base-matroid and inverse combinatorial optimization problems.
• Inverse optimization problems with multiple weight functions
• On some properties of base-matroids
• A simple algorithm and min-max formula for the inverse arborescence problem
• Algorithms for the partial inverse matroid problem in which weights can only be increased
• A particular class of graphic matroids
• Valid cycles: A source of infeasibility in open shortest path first routing
• The inverse fractional matching problem

This page was built for publication: Inverse problems of matroid intersection

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