Inverse problems of matroid intersection

DOI10.1023/A:1009883605691zbMath0959.90041OpenAlexW1487262857MaRDI QIDQ1970339

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 intersectionstrongly polynomial algorithmminimum cost circulation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

A simple algorithm and min-max formula for the inverse arborescence problem ⋮ Valid cycles: A source of infeasibility in open shortest path first routing ⋮ On some properties of base-matroids ⋮ The base-matroid and inverse combinatorial optimization problems. ⋮ A particular class of graphic matroids ⋮ Inverse optimization problems with multiple weight functions

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