Recommendations
Cites work
- scientific article; zbMATH DE number 1086909 (Why is no real title available?)
- scientific article; zbMATH DE number 949659 (Why is no real title available?)
- A Faster Algorithm for the Inverse Spanning Tree Problem
- A column generation method for inverse shortest path problems
- Combinatorial algorithms for inverse network flow problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow and minimum cut problems
- Inverse problem of minimum cuts
- Network flows. Theory, algorithms, and applications.
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Sequential and parallel algorithms for minimum flows.
- Solving inverse spanning tree problems through network flow techniques
Cited in
(15)- The inverse connected p-median problem on block graphs under various cost functions
- Inverse feasibility problems of the inverse maximum flow problems
- Inverse maximum flow problem in planar networks
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
- scientific article; zbMATH DE number 1484312 (Why is no real title available?)
- Solving the minimum flow problem with interval bounds and flows
- Constrained inverse minimum flow problems under the weighted Hamming distance
- Minimax inverse problems of minimum cuts
- The inverse maximum dynamic flow problem
- On inverse traveling salesman problems
- The inverse maximum flow problem consideringl∞norm
- The inverse maximum flow problem with lower and upper bounds for the flow
- Capacity inverse minimum cost flow problem
- Inverse maximum flow and minimum cut problems
This page was built for publication: Inverse minimum flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874337)
