| Article ID: | iaor20072037 |
| Country: | Netherlands |
| Volume: | 12 |
| Issue: | 4 |
| Start Page Number: | 394 |
| End Page Number: | 407 |
| Publication Date: | Dec 2006 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Zhang Jianzhong, Liu Longcheng |
In this paper, we consider inverse maximum flow problem under the weighted Hamming distance. Four models are studied: the problem under sum-type weighted Hamming distance; the problem under bottleneck-type weighted Hamming distance and two mixed types of problems. We present their respective combinatorial algorithms that all run in strongly polynomial times.