The inverse maximum dynamic flow problem

The inverse maximum dynamic flow problem

导出

摘要 We consider the inverse maximum dynamic flow (IMDF) problem.IMDF problem can be described as: how to change the capacity vector of a dynamic network as little as possible so that a given feasible dynamic flow becomes a maximum dynamic flow.After discussing some characteristics of this problem,it is converted to a constrained minimum dynamic cut problem.Then an efficient algorithm which uses two maximum dynamic flow algorithms is proposed to solve the problem. We consider the inverse maximum dynamic flow (IMDF) problem.IMDF problem can be described as: how to change the capacity vector of a dynamic network as little as possible so that a given feasible dynamic flow becomes a maximum dynamic flow.After discussing some characteristics of this problem,it is converted to a constrained minimum dynamic cut problem.Then an efficient algorithm which uses two maximum dynamic flow algorithms is proposed to solve the problem.

作者 BAGHERIAN Mehri

机构地区 Faculty of Electronics and Electrical Engineering

出处《Science China Mathematics》 SCIE 2010年第10期2709-2717,共9页 中国科学：数学（英文版）

关键词 NETWORK FLOWS INVERSE optimization DYNAMIC NETWORK FLOWS network flows inverse optimization dynamic network flows

分类号 O224 [理学—运筹学与控制论]

引文网络
相关文献

参考文献19

1Longcheng Liu,Jianzhong Zhang.Inverse maximum flow problems under the weighted Hamming distance[J]. Journal of Combinatorial Optimization . 2006 (4)
2D. Burton,Ph. L. Toint.On the use of an inverse shortest paths algorithm for recovering linearly correlated costs[J]. Mathematical Programming . 1994 (1-3)
3D. Burton,Ph. L. Toint.On an instance of the inverse shortest paths problem[J]. Mathematical Programming . 1992 (1-3)
4Ahuja R K,Orlin J B.Inverse optimization. Operations Research . 2001
5Cao Y,Guan X.A class of constrained inverse bottleneck optimization problems under weighted hamming distance. Proceedings of the Second Joint Conference on Computational Sciences and Optimization . 2009
6Deaconu A.The inverse maximum flow problem considering l∞-norm. RAIRO Operations Research . 2008
7Ford L R,Fulkerson D R.Constructing maximal dynamic flows from static flows. Operations Research . 1958
8Gentry S,Saligrama V,Feron E.Dynamic Inverse Optimization. Proceedings of American Control Conference . 2001
9Hoppe B.Efficient dynamic network flow algorithms. . 1995
10Kostrzewski S.Inverse kinematics optimization and collision avoidance for KineMedic project. 31rd Summer European University on Surgical Robotics . 2007

1HUANG De\|cai College of Information Engineering, Zhejiang University of Technology, Hangzhou 310014, China.An Efficient Algorithm for Obtaining the Optimum Solution of a Generalized Assignment Problem[J].Systems Science and Systems Engineering,1999,9(3):314-319.
2Xinru Li.From Different Thinking Discussing the Principles of Intercultural Translation[J].International Journal of Technology Management,2013(8):93-95.
3刘彦佩.The Efficient Recognition on Net-extensibility of Graphs[J].Chinese Science Bulletin,1993,38(7):533-536.
4杨忠华.CLASSIFICATION OF PITCHFORK BIFURCATIONS AND THEIR COMPUTATION[J].Science China Mathematics,1989,32(5):537-549.
5孔俊宝.NEW EFFICIENT ALGORITHM FOR NONLINEAR CIRCUIT SYSTEM[J].Science China Mathematics,1989,32(6):746-757.
6LIU Baijun,ZHENG Zhongguo & ZHAO Hui School of Mathematical Sciences, Peking University, Beijing 100871, China,Department of Statistics, Central China Normal University, Wuhan 430079, China.An efficient algorithm for finding the largest chain graph according to a given chain graph[J].Science China Mathematics,2005,48(11):1517-1530. 被引量：2
7赵峥,戴宪新.A NEW APPROACH FOR DISCUSSING BACK-REACTION OF BLACK HOLES[J].Chinese Science Bulletin,1992,37(22):1895-1898.
8涂承媛.THE MECHANISM OF AUTOMATIC CONTROL WITH VARIABLE STRUCTURE-PARAMETERS[J].Chinese Science Bulletin,1991,36(2):167-169.
9LU HongLiang1,& YU QingLin2 1Center for Combinatorics,LPMC,Nankai University,Tianjin 300071,China,2Department of Mathematics and Statistics,Thompson Rivers University,Kamloops V2C5N3,Canada.Constructive proof of deficiency theorem of (g,f)-factor[J].Science China Mathematics,2010,53(6):1657-1662.
10张化光,陈来九.A FUZZY DECISION-MAKING TECHNIQUE WITH TWO KINDS OF UNCERTAINTY[J].Science China Mathematics,1991,34(12):1508-1518.

Science China Mathematics

2010年第10期

浏览历史

内容加载中请稍等...

The inverse maximum dynamic flow problem

参考文献19

相关作者

相关机构

相关主题

浏览历史