Skip to Content
算法技术手册(原书第2 版)
book

算法技术手册(原书第2 版)

by George T.Heineman, Gary Pollice, Stanley Selkow
August 2017
Intermediate to advanced
360 pages
8h 35m
Chinese
China Machine Press
Content preview from 算法技术手册(原书第2 版)
网络流算法
227
网络流算法
供应
sup
(
s
i
)
、需求
dem
(
t
j
)
以及容量
c
(
u
,
v
)
都大于
0
。每条边关联的航运费用
d
(
u
,
v
)
大于
等于
0
。计算出结果之后,所有流量
f
(
u
,
v
)
都大于等于
0
现在,我们准备来解决图
8-1
其余的流网络问题。对于每个问题,我们都会述它是
如何被归约成最小费用流问题的。
8.6 转运问题
输入包括:
m
个供应站
s
i
,每个供应站能够生产
sup
(
s
i
)
个单位的商品。
n
个需求站
t
j
,每个需求站需要
dem
(
t
j
)
个单位的商品。
w
个仓库
w
k
,每个仓库能够接收和转运最多
max
k
个单位的商品,转运的固定费
用为每单位
wp
k
从供应站
s
i
运送到需求站
t
j
的固定单位费用为
d
(
i
,
j
)
,从供应站
s
i
运送到仓库
w
k
的固定
单位费用为
t
s
(
i
,
k
)
,从仓库
w
k
转运到需求站
t
j
的固定单位费用为
t
s
(
k
,
j
)
。我们的目标是
找出从供应站
s
i
到需求站
t
j
的具有最小费用的流量
f
(
i
,
j
)
,简要定义如下:
总费用(
TC
=
总运输费用(
TSC
+
总转运费用(
TTC
TSC
= ∑
i
j
d
(
i
,
j
)*
f
(
i
,
j
)
TTC
= ∑
i
k
ts
(
i,k
)*
f
(
i,k
)+ ∑
j
k
ts
(
j,k
)*
f
(
j,k
)
目标是寻找到整数值
f
(
i, j
)
0
,确保在满足供应和需求限制的前提下
TC
最小。最后,
通过仓库的网络流单位必须为
0
,这是为了确保没有丢失(或增加)任何单位。
sup
(
s
i
)
dem
(
t
i
)
均大于
0
。运输
费用
d
(
i,j
)
ts
(
i,k
)
ts
(
k,j
)
大于等于 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

Aurélien Géron
Go语言编程

Go语言编程

威廉·肯尼迪

Publisher Resources

ISBN: 9787111562221