robustpartialinversenetworkflowproblems

CSpace > 系统科学研究所

	robustpartialinversenetworkflowproblems
	Yang Xiaoguang
	2001
发表期刊	appliedmathematicsseriesbajournalofchineseuniversities
ISSN	1005-1031
卷号	016 期号:002 页码:185
摘要	Abstract. In this paper,a new model for inverse network flow problems,robust partial inverseproblem is presented. For a given partial solution,the robust partial inverse problem is to modify the coefficients optimally such that all full solutions containing the partial solution becomeoptimal under new coefficients. It has been shown that the robust partial inverse spanning treeproblem can be formulated as a combinatorial linear program,while the robust partial inverseminimum cut problem and the robust partial inverse assignment problem can be solved by combinatorial strongly polynomial algorithms.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/44948
专题	系统科学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Yang Xiaoguang. robustpartialinversenetworkflowproblems[J]. appliedmathematicsseriesbajournalofchineseuniversities,2001,016(002):185.
APA	Yang Xiaoguang.(2001).robustpartialinversenetworkflowproblems.appliedmathematicsseriesbajournalofchineseuniversities,016(002),185.
MLA	Yang Xiaoguang."robustpartialinversenetworkflowproblems".appliedmathematicsseriesbajournalofchineseuniversities 016.002(2001):185.