Inverse matroid intersection problem
From MaRDI portal
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
- A column generation method for inverse shortest path problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A strongly polynomial minimum cost circulation algorithm
- A weighted matroid intersection algorithm
- An inverse problem of the weighted shortest path problem
- 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?)
- On an instance of the inverse shortest paths problem
Cited in
(13)- Note on inverse problem with l_ objective function
- Inverse problem of minimum cuts
- A further study on inverse linear programming problems
- Inverse problems of submodular functions on digraphs
- Some reverse location problems
- The base-matroid and inverse combinatorial optimization problems.
- Inverse problems of matroid intersection
- Inverse optimization problems with multiple weight functions
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- The minmax regret inverse maximum weight problem
- A simple algorithm and min-max formula for the inverse arborescence problem
- Complexity of some inverse shortest path lengths problems
- Inverse matroid optimization problem under the weighted Hamming distances
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)
