9:

9.1
, .

.
.
.

.
,
(, , , , .)
. ,

.

,
, ,
.
Kirchhof ,
.

.

9.2
( ) () (
) ( ) G = {V,A}, V
. i j
(i, j). ,
(directed oriented),
(undirected).
, (mixed). (i,j)
i j.

.

. ,
(indegree)
(outdegree).

102

 ( )
. ,
.
(.. S = {a, b, c, . ., i, j, k}) (.. S = {(a, b), (b,
c), . . ., (i, a), (j, k)}].

. ( )
.
. i
j i
j.
.
.

i j.
i j ,
.
G = (V,A) G = (V,A)
VCV C. V.
. ,
n n-1 . ,
. (spanning
tree) G G.

.
, , , .
G
. d(i, j)
i j.

9.3

, .
( )
( ) ,
.
(), Dijkstra
.
,
,
.
,
.

103

 :
.

. ,
( 0) .
,
.
n- : n- .
( n = 1,2,... o n-
.
n- : (n-1)
( ),
. (
).
n- :
n-
n- .
-
. (
.)
n- :


( ).
n-
( ),
.
9.1

( )
.
.

104

1
2
4
5
6

D
E

9.1: Dijkstra

D
E

D
D
D

2
4
2+2 = 4
2+7 = 9
4+3 = 7
4+4 = 8
2+7 = 9
4+4=8
7+1 = 8
8+5 = 13
7+7 = 14

n-

2
4
4

OC

D
D

8
8
13

D
ED
D

,
.

DAO DAO.

ABEDT OADT, 13 .

.

.
. ,
,
. ,
. ,

. ,
. ,
.
Dijkstra
. ,
, n

105

 n . ,
(n + n-1 + + 1) = (n2).

9.4
,
.
,
,
.
,
(
) . ,
.
.
, ,
,
.
,
. ,
,
.
.
' ,
,
.
( Prim)
()
( ).
, ,
,
(), '
.
,
.
, ,
.
.
Prim
1. .
2.
. 2
.

1
2
106

 . ,
( ) .
9.2

,
.
, :

1: , C. ,
BC , 1.
2:
, B
1+2 = 3.
3:
,
3+2 = 5.
4:
, B
5+3 = 8.
5:
D, DE
8+1 = 9.
6:
T, TD
9+5 = 14.
.

14.
.
T
5

1
E

107

 Prim
n , n
. ,
( )
.
m, (m),
(mn). ,
.
:
Kruskal
1. .
2. .
.
2 .

,
. ,
( )
. ,
Kruskal :
1: ( BC DE)
, DE,
.
2: BC. ,
.
3: ,
2. ,
.
4: . ,
.
5: . ,
.
6: ( C, CE
BD). E , OC.
, .
7: ( CE BD)
, C. ,
.
8: D. ,
.
9: , DT
5. , O
.

108

 10: DT. ,
.
.

.
(..
)
.
:
.
, .

.
.
.
,
. , S =
{(a,b),(b,d),(e,a)} (a,b), (b,d)
(e,a). ,
:
1. ,
,
.
2. ,
,
.
3. ,
.
4. ,
.
.
A Kruskal .

. m
(mlgm). ( )
(n) . ,
m ,
. , (mlgm) + (mn) = O(mn).
Prim, ,
.

9.5

,
109

 . (
, ).

. ,

. ,
. ,
,
, C
CD. ,
C ( T D
), .
, ( )
.
.

,
.
1. .
. (
, ).
2. (
, , C, D ).
3. .
(i, j) i j
,
uij.
.
.
4. (
), .
5.
, .
:

110

1.
.
2.
.
3. .
4. .
5. .
,

,
. ,
. ,

.
.
,
.
.

. ,
,
.
.
.
,
,
,
.

simplex. ,
.
, (residual
network) (augmenting path).
,
.
, 7.

, 7-5
= 2. .

111

. ,
2 , 5
5
(
).
, ,
,
. , ,
. ,
,
0, .
,

.


.

,
. ,
.

.
,
.

,

. ,
:

1. (
,
). ( ,
.)
2. o
( c*)
c*.

112

3. c* .
c*
. 1.
1,
.

,
.
9.3
(
) ,
.

1. ,
min{7,5,6} = 5. 5
, :

2. 3 D.
:

3. 1 D.

113

 4. 2 D.
:

5. 1 CED.
6. 1 CE.
:

7. 1 CEBD.
:

,
14.

.
, ,
.
.

114


ij ,
ji c*, c*
ij. ,
. , ,
(
0). , 1
CEBD 7. ,
, 1
()
D C.

9.5.1
, ,
.
:
, ,
. ,
( ),

. .

.
, (
) .
6 .

, '
,
.
, -
- (max-flow min-cut theorem). (cut)
,
. ,
. (cut value)
115

 ( ).
- -,
,
. , F
,
F F. ,
,
,
. , ,
, .
, ,
.

3+4+1+6 =
14, F
. 7, F =
14,
. ,
.

9.6

,
.
,
. ,
( ) .
,
, . ,

.
:
1. .
2. .
3. .
116

4. .
5.

. ,
.
6.
- -.
7.
.
8.
. (
.)

9.6.1

n
.
:
xij = ij
:
cij = ij
uij = ij
bi = i.
i,
bi > 0 i
bi < 0 i
bi = 0 i .

.

,

Min Z = cij xij

i =1 j =1

s.t.

x x
j =1

ij

j =1

ji

= bi , i,

0 xij uij , i j.

i, i. ,
.
, Lij > 0
ij. ,

117

 xij = xij - Lij, xij = xij + Lij,

.
,

. , ,
.
:

n

b = 0 .
i =1

-
-.
bi ,
( )
. ,
(
cij = 0 ),
( cij = 0
).
, bi uij ,
xij . ,
,

.
:
bi uij ,
.
9.4
.

bA = 50

cAD = 9

bD = -30

uAB = 10

D
cAC = 4

bC = 0

cED = 2

cAB = 2
cBC = 3

cDE = 3

uCE = 80
cCE = 1

bB = 40

bA = -60

118

 bi , cij
. bi > 0, , bi <
0 . , bi = 0,
.
(50 + 40 = 90),
, .

Min = 2xAB + 4xAC + 9xAD + 3xBC + xCE + 3xDE + 2xED
s.t. xAB + xAC + xAD = 50
-xAB + xBC = 40
-xAC xBC + xCE = 0
-xAD + xDE + xED = -30
-xCE xDE + xED = -60
xAB < 10, xCE < 80, xij > 0

.
, +1 -1.

.

.
,
( bi 0), 0 .
,
.

9.6.2

.
,

.
, xij i
j xij ij.
cij ij.
,
uij .
.
,
, bi = 1 bi = -1
. ,
.
.
, bi = 1

119

 , bi = -1 ,
.
,
,
.
i j cij. ,
, uij = .
. ,
. , cij =
0 ,
. , F
,
F (
, bi = 0. ,

cij = (uij = ).
,
,
.

.

.

,
.

9.7
9.1
Dijkstra,
.
.

120

9.8
Ahuja et al. (1993).
Dijkstra
(1959). Prim
(1957) Kruskal (1956).
Ford and Fulkerson (1956). ,
.
(1962)
.

121


Ahuja RK, Magnanti TL and Orlin JB, (1993). Network Flows: Theory, Algorithms
and Applications, Prentice Hall.
Bazaraa MS, Jarvis JJ and Sherali HD, (2004). Linear Programming and Network
Flows, Wiley-Interscience.
Bazaraa MS, Sherali HD and Shetty CM, (2006). Nonlinear Programming: Theory
and Algorithms, Wiley.
Bellman R, (2003). Dynamic Programming, Dover Publications.
Bertsekas DP, (1999). Nonlinear Programming, Athena Scientific.
Bertsekas DP, (1999). Dynamic Programming and Optimal Control, Athena Scientific.
Bertsimas D and Tsitsiklis JN, (1997). Introduction to Linear Optimization, Athena
Scientific.
Bixby RE, Fenelon M, Gu Z, Rothberg E and Wunderling R, (1999). MIP: Theory
and Practice Closing the Gap, Proceedings of IFIP TC7 Conference, Cambridge.
Cook SA, (1971). The Complexity of Theorem Proving Procedures, Proc. 3rd ACM
Symp. on the Theory of Computing, ACM, 151-158.
Cook WJ, Schrijver A, Cunningham WH and Pulleyblank WR, (1997).
Combinatorial Optimization, John Wiley & Sons.
Cormen TH, Leiserson CE, Rivest RL, Stein C, (2001). Introduction to Algorithms,
The MIT Press.
Crowder H, Johnson EL, and Padberg M, (1983). Solving Large-Scale Zero-One
Linear Programming Problems, Operations Research, 31: 803-834.
Dantzig G, (1998). Linear Programming and Extensions, Princeton University Press.
Dijkstra EW, (1959). A Note on Two Problems in Connection with Graphs,
Numerische Mathematik, 1: 269-271.
Edmonds J, (1965). Paths trees and Flowers, Canadian Journal of Mathematics, 17:
449-467.
Edmonds J, (1971). Matroids and the Greedy Algorithm, Mathematical Programming,
1: 127-136.

137

Ford LR and Fulkerson DR, (1956). Maximal Flow through a Network, Canadian
Journal of Mathematics, 8: 399-404.
Ford LR and Fulkerson DR, (1962). Flows in Networks, Princeton University Press.
Garey MR and Johnson DS, (1979). Computers and Intractability: A Guide to the
Theory of NP-Completeness, Freeman & Company.
Hillier FS and Lieberman GJ, (2001). Introduction to Operations Research,
McGraw-Hill Companies.
Hoffman KL and Padberg, (1991). Improving LP-Representations of Zero-One Linear
Programs for Branch and Cut, ORSA Journal on Computing, 3: 121-134.
Johnson EL, Kostreva MM and Suhl UH, (1985). Solving 0-1 Integer Programming
Problems Arising from Large Scale Planning Models, Operations Research, 33: 803819.
Karmarkar N, (1984). A New Polynomial Time Algorithm for Linear Programming,
Combinatorica, 4: 375-395.
Khachian LG, (1979). A Polynomial Algorithm for Linear Programming, Doklady
Akad. Nauk USSR, 244: 1093-1096, Translated in Soviet Math. Doklady, 20: 191-194.
Kruskal JB, (1956). On the Shortest Spanning Subtree of a Graph and the Traveling
Salesman Problem, Proc. Amer. Math. Soc., 7: 48-50.
Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB, (1985). The Traveling
Salesman Problem : A Guided Tour of Combinatorial Optimization, John Wiley & Sons.
Luenberger DG, (2003). Linear and Nonlinear Programming, Springer.
Martello S and Toth P, (1990). Knapsack Problems: Algorithms and Computer
Implementations, John Wiley & Sons.
Nemhauser GL and Wolsey LA, (1988). Integer and Combinatorial Optimization,
John Wiley & Sons.
Papadimitriou CH and Steiglitz K, (1998). Combinatorial Optimization: Algorithms
and Complexity, Dover Publications.
Prim RC, (1957). Shortest Connection Networks and Some Generalizations, BSTJ, 36:
1389-1401.
Schrijver A, (1998). Theory of Linear and Integer Programming, John Wiley & Sons.

138

Standish TA, (1995). Data Structures, Algorithms & Software Principles in C,

Addison-Wesley.
Van Roy TJ and Wolsey LA, (1987). Solving Mixed 0-1 Programs by Automatic
Reformulation, Operations Research, 35: 45-57.
Whitney H, (1935). On the Abstract Properties of Linear Dependence, Amer. J. Math.,
57: 509-533.
Williams HP, (1999). Model Building in Mathematical Programming, John Wiley &
Sons.
Wolsey LA, (1998). Integer Programming, John Wiley & Sons.

139