Inverse maximum flow problems under the weighted Hamming distance

Journal of Combinatorial Optimization

Volumn 12, Issue 4, 2006, Pages 394-407

  Liu, Longcheng ^a   Zhang, Jianzhong ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Hamming distance; Inverse problems; Maximum flow; Strongly polynomial algorithms

Indexed keywords

COMBINATORIAL ALGORITHMS; HAMMING DISTANCE; MAXIMUM FLOW; STRONGLY POLYNOMIAL ALGORITHMS;

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

INVERSE PROBLEMS;

EID: 33749612912     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9006-8     Document Type: Article

References (9)

1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice-Hall, Englewood Cliffs
2. Duin CW, Volgenant A (2006) Some inverse optimization problems under the Hamming distance. Eur J Oper Res 170:887-899
3. He Y, Zhang B, Yao E (2005) Wighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9:91-100
4. He Y, Zhang B, Zhang J (2006) Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. J Global Optim 34(3):467-474
5. Heuberger C (2004) Inverse optimization: a survey on problems, methods, and results. J Comb Optim 8:329-361
6. Schrijver A (2003) Combinatorial optimization, polyhedra and efficiency. Springer-Verlag, Berlin
7. Yang C, Zhang J, Ma Z (1997) Inverse maximum flow and minimum cut problems. Optimization 40:147-170
8. Yang X, Zhang J (2005) Some new results on inverse sorting problems. Lecture Notes in Computer Science vol. 3595, pp. 985-992
9. Zhang B, Zhang J, He Y (2005) The center location improvement problem under the Hamming distance. J Comb Optim 9:187-198