Full list from Jim Orlin's page
Page 39, Figure 2.19. The direction of the arc is not reversed
when the lower bound is removed.
Page 44. In line 4 of the second paragraph under
Working with Residual Networks, it should read
" .. flow from node
j to i over arc (j,i), ...".
Page 74, Figure 3.4. line 7 of the Search algorithm should read
order(s):=next;
Page 75, Figure 3.5. The search trees and the orders are not
correct as listed.
The
trees will be correct if you interchange the numbers of nodes 4
and 5 (i.e. call node 5 as 4 and vice versa).
Page 110. In line 4 (under Correctness of Dijkstra's
Algorithm), it should read
"(2) the distance label of
each node in S-- (in
place of S) is the shortest path ..."
Page 138, Figure 5.2. The update shown in figure (d) is
wrong. One can skip the update shown in figure (d) and
proceed
to the update shown in figure (e) where d(5) is changed
from infinity to 5.
Page 146, Theorem 5.5. It should read d[i,i]=0 for all i in
N.
Page 158, Problem 5.7 (a). The Bellman equations should
read d(j)=min{d(i) + c_{ij} : (i,j) \in AI(j)} for all j in N.
Page 204, Problem 6.34 (a). It should read
.. If x is a maximum flow ..
Page 297, under Assumption 9.4. It should read
.. if necessary, by adding artificial arcs (i,j)
and (j,i) for each ..
Page 475, first line. It should read
".. have earlier shown that Joan
prefers Steve to Dave .."
If you have spotted any errors/typos, please report the same to me -- Bala.