Inverse matroid intersection problem

DOI10.1007/BF01193863MaRDI QIDQ1362679zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Inverse problems of matroid intersection
• Inverse matroid optimization problem under the weighted Hamming distances
• The base-matroid and inverse combinatorial optimization problems.
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Inverse optimization problems with multiple weight functions

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A column generation method for inverse shortest path problems
• A strongly polynomial minimum cost circulation algorithm
• A weighted matroid intersection algorithm
• An inverse problem of the weighted shortest path problem
• On an instance of the inverse shortest paths problem

Cited in

(13)

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

This page was built for publication: Inverse matroid intersection problem

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