图书介绍

Flows in Networks2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载

L.R.Ford 著
出版社： Princeton University Press
ISBN：
出版时间：1962
标注页数：194页
文件大小：48MB
文件页数：203页
主题词：

PDF下载

点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快]温馨提示：（请使用BT下载软件FDM进行下载）软件下载地址页直链下载[便捷但速度慢] [在线试读本书] [在线获取解压码]

点击复制MD5值：d62e46bfc80d648677cb7aa5362ee5d8

下载说明

Flows in NetworksPDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

点击复制85GB完整离线版磁力链接到迅雷FDM等BT下载工具进行下载详情点击-查看共享计划

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！

（文件页数要大于标注页数，上中下等多册电子书除外）

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

图书目录

CHAPTER Ⅰ STATIC MAXIMAL FLOW1

Introduction1

1．Networks2

2．Flows in networks4

3．Notation9

4．Cuts10

5．Maximal flow11

6．Disconnecting sets and cuts14

7．Multiple sources and sinks15

8．The labeling method for solving maximal flow problems17

9．Lower bounds on arc flows22

10．Flows in undirected and mixed networks23

11．Node capacities and other extensions23

12．Linear programming and duality principles26

13．Maximal flow value as a function of two arc capacities30

References35

CHAPTER Ⅱ FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS36

Introduction36

1．A supply-demand theorem36

2．A symmetric supply-demand theorem42

3．Circulation theorem50

4．The K？nig-Egerváry and Menger graph theorems53

5．Construction of a maximal independent set of admissible cells55

6．A bottleneck assignment problem57

7．Unicursal graphs59

8．Dilworth＇s chain decomposition theorem for partially ordered sets61

9．Minimal number of individuals to meet a fixed schedule of tasks64

10．Set representatives67

11．The subgraph problem for directed graphs75

12．Matrices composed of 0＇s and 1＇s79

References91

CHAPTER Ⅲ MINIMAL COST FLOW PROBLEMS93

Introduction93

1．The Hitchcock problem95

2．The optimal assignment problem111

3．The general minimal cost flow problem113

4．Equivalence of Hitchcock and minimal cost flow problems127

5．A shortest chain algorithm130

6．The minimal cost supply-demand problem:non-negative directed cycle costs134

7．The warehousing problem137

8．The caterer problem140

9．Maximal dynamic flow142

10．Project cost curves151

11．Constructing minimal cost circulations162

References169

CHAPTER Ⅳ MULTI-TERMINAL MAXIMAL FLOWS173

Introduction173

1．Forests,trees,and spanning subtrees173

2．Realization conditions176

3．Equivalent networks177

4．Network synthesis187

References191