Errata and Corrections:
Printed:
like mountaineering expedition
Correction:
like a mountaineering expedition
Printed:
Chapter 95
Correction:
Chapter 7
Thanks to Wei-Lwun Lu for reporting this error.
Printed:
init(π, m)
Correction:
init(π)
Printed:
init(π', m)
Correction:
init(π')
Printed:
step(s)(s') > 0
Correction:
step(s,m)(s',m') > 0
for some m,m' ε M
Printed:
g(π)(s)
Correction:
g(π)
Printed:
an improving neighbouring candidate solution
Correction:
for an improving neighbouring candidate solution
Thanks to Camilo Rostoker for reporting this error.
Printed:
a δ-path p of minimal path weight is determined
Correction:
a δ-path p is determined
Printed:
step(s)(s') := p(g,s)
Correction:
step(s)(s') := p(g,s)(s')
Printed:
to immediately return
Correction:
from immediately returning
Thanks to Camilo Rostoker for reporting this error.
Printed:
localSearch(π,g',s)
Correction:
localSearch(π',g',s)
Thanks to Camilo Rostoker for reporting this error.
Printed:
if (f(s') < f(ŝ);
Correction:
if (f(s') < f(ŝ)) then
Thanks to Wei-Lwun Lu for reporting this error.
Printed:
updatePenalties(π,s')
Correction:
updatePenalties(π',s')
Printed:
by a factor
Correction:
by a value
Printed:
perturb(π',s')
Correction:
perturb(π',s)
Thanks to Camilo Rostoker for reporting this error.
Printed:
localSearch(π',sp')
Correction:
localSearch(π',sp)
Thanks to Camilo Rostoker for reporting this error.
Printed:
were originally developed for solving
Correction:
have been mostly applied to
Thanks to the person who reported this error on the amazon.de web site.
Printed:
{1,2,3}
Correction:
{0,1,2}
Printed:
with mean and variance 1/p.
Correction:
with mean p/(1-p) and variance p/(1-p)2.
Thanks to Eric Yuan for reporting this error.
Printed:
essentially 1-incomplete, where q'
is the optimal solution quality for the given problem instance.
Correction:
essentially 1-incomplete.
Printed:
Stützel
Correction:
Stützle
Printed:
by utility functions U(t,q) :
Correction:
by utility functions U :
Printed:
(as shown on the right side of Figure 4.7)
Correction:
(as shown on the right side of Figure 4.6)
Thanks to Camilo Rostoker for reporting this error.
Printed:
a probabilistic domination
Correction:
a probabilistic domination relation
Printed:
whether the medians of two samples are equal
Correction:
whether the medians of the probability distributions
underlying two given samples are equal
Printed:
ed[m](x) := 1-ex/m
Correction:
ed[m](x) := 1-2-x/m
Printed:
d := |N(s)|
Correction:
d := #N(s)
Printed:
m := |S(π)|
Correction:
m := #S(π)
'l' should be a real number,
not a positive integer, since evaluation functions can have real values.
Printed:
GWSAT
Correction:
GWSAT [Selman et al., 1994]
Printed:
x}' is dependent on x
Correction:
x' is dependent on x}
Thanks to Krzysztof Dabrowski for reporting this error.
Printed:
c} is dependent on x
Correction:
c is dependent on x}
Thanks to Krzysztof Dabrowski for reporting this error.
The weights of clauses
c4
and
c5
need to be swapped, i.e.,
c4
becomes a hard constraint with weight 7,
and
c5
becomes a soft constraint with weight 3.
Thanks to Krzysztof Dabrowski for reporting this error.
Printed:
0.9, and the better one otherwise.
Correction:
0.1, and the better one otherwise.
Printed:
IN-DEPTH
Correction:
IN DEPTH
Printed:
Hong, Kahng and Moon have studied
Correction:
Hong, Kahng and Moon [1997] have studied
Printed:
G' := (E',w')
Correction:
G' := (V, E', w')
Printed:
applied to n/2 pairs of tours that are
Correction:
applied to μ/2 pairs of tours, where μ is the population
size, that are
Printed:
uses the modified pheromone update rule
τij := τij + Δτijbest,
Correction:
uses for all edges (i,j) the modified pheromone update rule
τij := (1 - ρ) τij + Δ(i,j,pbest),
Printed:
Δτijbest
Correction:
Δ(i,j,pbest)
Printed:
if it has a makespan smaller than h(Cmax(Φ')),
where Cmax(Φ')
is the makespan of Φ' and the aspiration
function value h(Cmax(Φ')) is determined as follows.
Correction:
if it has a makespan smaller than h(Cmax(Φ)),
where Cmax(Φ)
is the makespan of the current candidate solution and the aspiration
function value h(Cmax(Φ)) is determined as follows.
Thanks to Krzysztof Dabrowski for reporting this error.
Printed:
for values equal to Cmax(Φ),
the makespan of the current candidate solution.
Correction:
for values equal to Cmax(Φ).
Thanks to Krzysztof Dabrowski for reporting this error.
Printed:
Then h(Φ) is set to
Correction:
Then h(Cmax(Φ)) is set to
Thanks to Krzysztof Dabrowski for reporting this error.
Printed:
good performing constructive algorithms
Correction:
high-performance constructive algorithms
Printed:
Southern
Correction:
southern
Printed:
for TSP, 43, 43f, 372, 537g
Correction:
2-exchange neighbourhood, for TSP, 43, 43f, 372, 537g
'FPTAS'
should be shown in italics, not in calligraphic letters,
since it is meant to refer to the abbreviation
for 'fully polynomial-time approximation scheme',
not the complexity class.
'PTAS'
should be shown in italics, not in calligraphic letters,
since it is meant to refer to the abbreviation
for 'polynomial-time approximation scheme',
not the complexity class.
How to report an error:
We are very interested in posting errors in our book along with corrections on this web page. If you found an error not contained in the list above, please contact Holger or Thomas.