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
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;
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
DOI :
10.1109/ICMSS.2010.5575657
