Inverse maximum flow and minimum cut problems

References

• Burton , D. and Toint , L. Ph . 1992 . On an instance of the inverse shortest paths problem . Mathematical Programming , 53 : 45 – 61 .
   Web of Science ®Google Scholar
• Zhang , J. , Ma , Z. and Yang , C. 1995 . A column generation method for inverse shortest path problem . Zeitschrft für Operations Research , 41 : 347 – 358 .
   Google Scholar
• Xu , S. and Zhang , J. 1995 . An inverse problem of the weighted shortest path problem . Japan Journal of Industrial and Applied Mathematics , 12 : 47 – 60 .
   Google Scholar
• Zhang , J. , Liu , Z. and Ma , Z. 1996 . On the inverse problem of minimum spanning tree with partition constraints . Zeitschrft für Operations Researcli , 44 : 171 – 187 .
   Google Scholar
• Zhang , J. and Ma , Z. 1996 . A network flow method for solving some inversecombinatorial optimization problems . Optimization , 37 : 59 – 72 .
   Google Scholar
• Ahuja , R.K. , Magnanti , T.L. and Orlin , J.B. 1993 . Network Flows , Englelvood Cliffs : Prentice-Hall .
   Google Scholar