Skip to main content
SpringerLink
Log in

Inverse maximum flow problems under the weighted Hamming distance

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang University, Hangzhou, China

    Longcheng Liu

  2. Department of System Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong, China

    Jianzhong Zhang

Authors
  1. Longcheng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianzhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Longcheng Liu.

Additional information

Research supported by the National Natural Science Foundation of China (60021201), and the Hong Kong Research Grant Council under CERG CityU 9041091 and CUHK 103105.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, L., Zhang, J. Inverse maximum flow problems under the weighted Hamming distance. J Comb Optim 12, 395–408 (2006). https://doi.org/10.1007/s10878-006-9006-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-9006-8

Keywords

Search

Navigation