- 1、本文档共36页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
10networkflows
TP SHUAI * Definition 10.18 An artificial network model and starting point for computing initial feasible solutions in minimum cost network flow problems can be constructed by (1) assigning 0 flow to all arcs of the original model, (2) introducing an artificial node, (3) creating artificial arcs from each supply node k (bk0) to the artificial node with flow equal to the specified supply |bk|, and (4) adding artificial arcs from the artificial node to each demand node k (bk0) with flow equal to the required demand |bk|. Finding starting feasible solutions Artificial network flow model * Although nay minimum cost network flow problem can be solved by the general-purpose linear programming methods of Chapter 5 and 6, implementations of cycle direction search algorithm 10A usually prove much more efficient. * Network flows versus LP 10.4 Integrality of Optimal Network Flows * When optimal network flows must be integer? Integrality property Lemma 10.20 If a minimum cost network flow model with integer constraint data (supplies, demands, and capacities) has any optimal solution, it has an integer optimal solution. Total unimodularity of node-arc incidence matrices Lemma 10.21 The constraint matrix A of a LP is totally unimodular if each square submatrix has determinant +1, 0, or -1. Lemma 10.22 Node-arc incidence matrices of network flow models are totally unimodular. * * * Princeton University ? COS 226 ? Algorithms and Data Structures ? Spring 2003 ? http://www.Princeton.EDU/~cs226 Chapter 10 Shortest Paths and Discrete Dynamic Programming Section 1 Graphs, Networks, and Flows Section 2 Cycle Directions for Network Flow Search Section 3 Rudimentary Cycle Directions Search Algorithms for Network Flows Section 4 Integrality of Optimal Network Flows Section 5 Transportation and Assignment Models Section 6 Other Single-Commodity Network Flow Models Section 7 Network Simplex Algorithm for Optimal Flows Section 8 Cycle Canceling Algorithms for
您可能关注的文档
- 102又好又快科学发展byzzone.ppt
- 陈国辉基础会计第三版第七章成本计算.ppt
- 105电路故障的判断.ppt
- 1061826f03《工程项目管理》工程项目风险控制与管理.ppt
- 105第五章基因工程载体.ppt
- 10911010327z.ppt
- 109离散型随机变量的均值与方差正态分布.ppt
- 10instrument.ppt
- 10kV配电.ppt
- 10kV配电网规划方法.ppt
- 湛江市人力资源和社会保障局2025年度招聘雇员笔试模拟试题及答案解析.docx
- 2025广东惠州市博罗县人民政府办公室招聘编外人员3人笔试模拟试题及答案解析.docx
- 2025湖州经开投资发展集团有限公司及下属子公司招聘11人笔试模拟试题及答案解析.docx
- 2025河南洛阳文化旅游职业学院招聘教师15人笔试模拟试题及答案解析.docx
- 2025广东惠州市龙门县城投河砂开采有限公司招聘职工1人笔试模拟试题及答案解析.docx
- 2025至2031年中国塑料杂物桶行业投资前景及策略咨询研究报告.docx
- 2025年3月湖南省长沙县卫生健康局所属基层医疗卫生机构公开招聘编外工作人员14人笔试模拟试题及答案解析.docx
- 2025华中科技大学同济医学院附属协和医院神经内科医疗岗位招聘(湖北)笔试模拟试题及答案解析.docx
- 2025商洛市洛南县乡镇民政协管员招聘(8人)笔试模拟试题及答案解析.docx
- 2025福建福清文投集团招聘3人笔试模拟试题及答案解析.docx
文档评论(0)