Inverse matroid intersection problem

DOI10.1007/BF01193863zbMath0882.90107OpenAlexW1809557030MaRDI QIDQ1362679

Mao-cheng Cai, Yanjun Li

Publication date: 5 August 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01193863

zbMATH Keywords

minimum cost circulationinverse matroid intersection problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (11)

A simple algorithm and min-max formula for the inverse arborescence problem ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ The minmax regret inverse maximum weight problem ⋮ Complexity of some inverse shortest path lengths problems ⋮ The base-matroid and inverse combinatorial optimization problems. ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Inverse problem of minimum cuts ⋮ A further study on inverse linear programming problems ⋮ Inverse optimization problems with multiple weight functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• On an instance of the inverse shortest paths problem
• An inverse problem of the weighted shortest path problem
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A weighted matroid intersection algorithm
• A column generation method for inverse shortest path problems

This page was built for publication: Inverse matroid intersection problem