Corrections

to the book Integer Programming, Wiley, New York (1998).

N.B. error in year of publication

p253 b2 Jer77. R.G. Jeroslow, Cutting Plane Theory: Disjunctive Methods,

{\it Annals of Discrete Mathematics} {\bf 1}, 293-330 (1977).

p133 b5 Replace [Jer72] by [Jer77].

Other mistakes to be corrected

p10 b5 add at end of line: , $x_{ij} \geq 0$ for all $i \in M, j \in N$.

p12 b5 at end of line $X\setminus \{(2,2)\}$

p19 problem 3 (i):     Replace Section 1.4 by Section 1.5

p20, problem 8: Replace Section 1.4 by  Section 1.5

p21, problem 9: Replace Section 1.2 by  Section 1.3

p25 b4 Replace P^i by P_i

p30 b1 Replace 32 by 22

p34 t5 Replace edges by nodes

p39 b7 Replace det(A) by det(B)

p46 b1 f(A)-f(B) \leq f(A \cup B)-f(B)

p47 t1 [f(B \cup \{j\})]

p48 t10 Replace 0- - 1 by 0-1

p58 Prop 4.5 line 2:   $...... -v_j \leq 0$ for all $i,j$, and

p69 Proposition 5.1 (ii) Replace $k > 0$ by $k \geq 0$

p83 t13 Replace |X| by L(X)

p85 b6. Second sentence. As $R \in \cal{NP}$ and $Q ..... By (i), as $Q \in \cal{P}$ and ...

p94 Middle of page.  (i)  Replace z_t by z^t

p94 Middle of page.  (ii)  Replace \bar{z}_t by \bar{z}^t

p100 Fig 7.10 If $\bar{z}^i \leq \underline{z}$, prune by bound

p110, problem 7: Replace N_1, N_2 by  NB_1, NB_2

p120 t10 Replace cx by \pi x

p122 t10 Replace P^2 cup Z^n by P^2 cap Z^n

p132 t3,t4 add space after first comma

p141 t13 Replace 3x_3 by 3x_2

p144 t14 Add: ,$x_i \leq 1$ for $i=1,\ldots,m$ after $my$ in the definition of $X$

p144 b5 Modify and add: $\sum_{k=1}^mx_k \leq my, x_k \leq 1$ for $k=1,\ldots,m$

p145 t1,t2,t3 Modify: $\sum_{k=1}^mx_k \leq my$

p145 t10 Add: ,$x_i \leq 1$ for $i=1,\ldots,m$ after $my$ in the definition of $X$

p150 t8 to show that if $C$ is a minimal cover with $|C|>1$, then .....

p152 t11,t12,t13 and b7 Replace \sum_{j \in N \setminus .....} by \sum_{j \in N_{2} \setminus .....}

page 161, problem 2: Add T \subset N

p162 Exercise 3 (ii):  x=(\frac{1}{4},\frac{1}{8},\frac{3}{4},\frac{3}{4},0)

page 164, problem 13: Replace  x \geq R^{nm}_+  by  x \in R^{nm}_+.   After
Fig. 9.8, replace  \sum_{i \in N}a_i by \sum_{i \in M}a_i

p171 t15 $u=(0,0,-15,0,0)$

p172 t9 Replace \{x_1,\ldots,x_T\} by \{x^1,\ldots,x^T\}

p172 b14 Replace  $R^T_+$  by  $R^m_+$

p178 Example 10.3 z(u) is not correct

p191 Spaces between rows of the first two matrices

p195 t8 Replace $ = 1$by $\leq 1$

p195 t9 Replace $ \leq 1$by $ = 1$

p198 b6 Replace \min by \max

p199 b7 Replace \min by \max, and replace -1y_1-0y_2-0y_3 by -0y_1-0y_2-1y_3

b211 (12.3)   Replace $b_i$ by $b_j$

p223 b1 Replace \sum_{i=1}^t by \sum_{i=t}^n

p224 t9 h=(.....),p=0$ and $f=(...)

p225 t8 Replace s_t by s_{t-1}

p225 Fig 13.2 Replace y_2=0.69 by y_2=0.19

p228 t1 Replace Subsection 13.2.1 by Subsection 13.3.1

p230 t7 Insert after: in Figure 13.5  "with $u_{ij}=6$ on all arcs"

p230 Fig 13.5 Replace (2,1/2) by (2,1/3) on arc (1,2)

p234 b1 Replace Section 13.2 by Section 13.3

p236 b4 Insert after: identical rings "(copies of the graph)"

p237 t10  Replace line by:   $y^k_e$ is the fraction of the demand $d_e$ assigned to ring $k$, and

p237 (13.38) y^k_e \in R^1_+

p238 A3 $X^k$ contains mixed integer knapsack constraints

p242 Exercise 5. Replace last sentence by "See Exercise 8.7".

p245 AarVer97   Ch. 11 in [DelAMafMar97].

p247 t2 Beas93    Add C.R. Reeves, ed.,

Typos

p86 t12 satisfies

p200 Note 11.4  t1 programming

Please send errors and comments to wolsey@core.ucl.ac.be Errors will be inserted in this list, and I will try to reply to more detailed comments reasonably quickly, but no promises.