Article contents
The inverse fractional matching problem
Published online by Cambridge University Press: 17 February 2009
Abstract
This paper presents a method for the inverse fractional matching problem. We show that the dual of this inverse problem can be transformed into the circulation flow problem on a directed bipartite graph which can be solved easily. We also give an algorithm to obtain the primal optimum solution of the inverse problem from its dual optimum solution by solving a shortest path problem. Furthermore, we generalize this method to solve the inverse symmetric transportation problem.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1999
References
- 2
- Cited by