Algorithms for the partial inverse matroid problem in which weights can only be increased
From MaRDI portal
Publication:312484
DOI10.1007/S10898-016-0412-XzbMATH Open1390.90454OpenAlexW2276896195MaRDI QIDQ312484FDOQ312484
Recommendations
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Inverse matroid optimization problem under the weighted Hamming distances
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- A weighted linear matroid parity algorithm
- A weighted linear matroid parity algorithm
- Exact and approximation algorithms for weighted matroid intersection
- Exact and approximation algorithms for weighted matroid intersection
- On the inverse of a class of weighted graphs
- On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
- Inverse problems of matroid intersection
Cites work
- scientific article; zbMATH DE number 5823945 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- A weighted matroid intersection algorithm
- Complexity of partial inverse assignment problem and partial inverse cut problem
- Encyclopedia of Optimization
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- On an instance of the inverse shortest paths problem
- Partial inverse assignment problems under \(l_{1}\) norm
- Robust partial inverse network flow problems
- The base-matroid and inverse combinatorial optimization problems.
- The partial inverse minimum cut problem with \(L_1\)-norm is strongly NP-hard
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Topics in Matroid Theory
Cited in
(10)- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- The minmax regret inverse maximum weight problem
- Complexity of partial inverse assignment problem and partial inverse cut problem
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Partial inverse maximum spanning tree problem under the Chebyshev norm
This page was built for publication: Algorithms for the partial inverse matroid problem in which weights can only be increased
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312484)
