Inverse minimum cost flow problems under the weighted Hamming distance

European Journal of Operational Research

Volumn 207, Issue 1, 2010, Pages 50-54

  Jiang, Yiwei ^a   Liu, Longcheng ^b   Wu, Biao ^c   Yao, Enyu ^c  

^a ZHEJIANG SCI TECH UNIVERSITY   (China)

^b XIAMEN UNIVERSITY   (China)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

APX hard; Hamming distance; Inverse problem; Network flows; Strongly polynomial algorithm

Indexed keywords

APX-HARD; COST VECTORS; MINIMUM COST FLOW PROBLEM; MINIMUM COST FLOWS; NETWORK FLOWS; SET PROBLEMS; STRONGLY POLYNOMIAL ALGORITHM;

ALGORITHMS; COST ACCOUNTING; HAMMING DISTANCE; INVERSE PROBLEMS; POLYNOMIALS;

COSTS;

EID: 77953872605     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.03.029     Document Type: Article

References (14)

1. Ahuja R., Magnanti T., and Orlin J. Network Flows: Theory, Algorithms and Applications (1993), Prentice Hall, New York
2. Ahuja R., and Orlin J. Inverse optimization. Operations Research 49 (2001) 771-783
3. He Y., Zhang B., and Yao E. Weighted inverse minimum spanning tree problems under Hamming distance. Journal of Combinatorial Optimization 9 (2005) 91-100
4. Heuberger C. Inverse optimization: A survey on problems, methods, and results. Journal of Combinatorial Optimization 8 (2004) 329-361
5. Kann, V., 1992. On the approximability of NP-complete optimization problems. Ph.D Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Sweden.
6. Liu L.C., and He Y. Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values. Progress in Natural Science 16 6 (2006) 649-655
7. Liu L., and Wang Q. Constrained inverse min-max spanning tree problems under the weighted Hamming distance. Journal of Global Optimization 43 (2009) 83-95
8. Liu L., and Yao E. A weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia-Pacific Journal of Operational Research 24 (2007) 725-736
9. Liu L., and Yao E. Inverse min-max spanning tree problem under the weighted sum-type Hamming distance. Theoretical Computer Science 396 (2008) 28-34
10. Liu L., and Zhang J. Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization 12 (2006) 395-408
11. Yang X., and Zhang J. Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems. Computational Optimization and Applications 36 (2007) 55-66
12. Zhang B., Zhang J., and He Y. The center location improvement problem under the Hamming distance. Journal of Combinatorial Optimization 9 (2005) 187-198
13. Zhang B., Zhang J., and He Y. Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. Journal of Global Optimization 34 (2006) 467-474
14. Zhang J., and Liu Z. Calculating some inverse linear programming problems. Journal of Computational and Applied Mathematics 72 (1996) 261-273