Inverse maximum flow problems under the weighted Hamming distance

Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice-Hall, Englewood Cliffs

Duin CW, Volgenant A (2006) Some inverse optimization problems under the Hamming distance. Eur J Oper Res 170:887–899

He Y, Zhang B, Yao E (2005) Wighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9:91–100

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

Heuberger C (2004) Inverse optimization: a survey on problems, methods, and results. J Comb Optim 8:329–361

Schrijver A (2003) Combinatorial optimization, polyhedra and efficiency. Springer-Verlag, Berlin

Yang C, Zhang J, Ma Z (1997) Inverse maximum flow and minimum cut problems. Optimization 40:147–170

Yang X, Zhang J (2005) Some new results on inverse sorting problems. Lecture Notes in Computer Science vol. 3595, pp. 985–992

Zhang B, Zhang J, He Y (2005) The center location improvement problem under the Hamming distance. J Comb Optim 9:187–198