• DocumentCode
    2135863
  • Title

    General Inverse Maximum Flow Problem under Sum-Type Weighted Hamming Distance

  • Author

    Dong, Liwei ; Yin, Weijing ; Wang, Hong

  • Author_Institution
    Coll. of Software, Shenyang Normal Univ., Shenyang, China
  • fYear
    2010
  • fDate
    24-26 Aug. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    The general inverse maximum flow problem is considered, where lower and upper bounds for the flow are changed so that a given feasible flow becomes a maximum flow and the modification cost that is measured by sum-type weighted Hamming distance is minimum.We present the combinatorial algorithm for solving the problem that runs in strongly polynomial times.
  • Keywords
    combinatorial mathematics; information theory; polynomials; combinatorial algorithm; general inverse maximum flow problem; modification cost; polynomial times; sum type weighted Hamming distance; Electronic mail; Hamming distance; Optimization; Polynomials; Software; Upper bound; Weight measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Management and Service Science (MASS), 2010 International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-5325-2
  • Electronic_ISBN
    978-1-4244-5326-9
  • Type

    conf

  • DOI
    10.1109/ICMSS.2010.5575657
  • Filename
    5575657
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2135863