X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/book_gpu.git/blobdiff_plain/a2aa3f0f91a668ee6e799bad0f4de90b7b2be452..HEAD:/BookGPU/Chapters/chapter8/ch8.tex?ds=inline

diff --git a/BookGPU/Chapters/chapter8/ch8.tex b/BookGPU/Chapters/chapter8/ch8.tex
index 46f6499..ff9c80d 100644
--- a/BookGPU/Chapters/chapter8/ch8.tex
+++ b/BookGPU/Chapters/chapter8/ch8.tex
@@ -1,5 +1,5 @@
 
-\chapterauthor{Imen Chakroun and Nouredine Melab}{University of Lille 1 CNRS/LIFL/INRIA, France}
+\chapterauthor{Imen Chakroun and Nouredine Melab}{University of Lille 1, CNRS/LIFL/INRIA, France}
 %\chapterauthor{Nouredine Melab}{Universit\'e Lille 1 CNRS/LIFL, INRIA Lille Nord Europe, Cit\'e scientifique - 59655, Villeneuve d'Ascq cedex, France\\}
 
 \chapter{GPU-accelerated tree-based exact optimization methods}
@@ -78,7 +78,7 @@ Set the Best\_Solution to $\emptyset$; \\
     }
 }
 
-\caption{general template of the branch-and-bound algorithm.}
+\caption{general template of the branch-and-bound algorithm}
 \label{ch8:algoBB}
 \end{algorithm}
 
@@ -533,7 +533,7 @@ Using the approach defined in \cite{ch8:Mezmaz_2007}, it is possible to obtain a
 \begin{itemize}
 \item compute, using the approach defined in \cite{ch8:Mezmaz_2007}, a list $L$ of subproblems such as the resolution of $L$ lasts $T$ minutes with a sequential B\&B;
 \item initialize the pool of our sequential B\&B with the subproblems of this list $L$;
-\item solve the subproblems of this pool with our sequential B\&B ,
+\item solve the subproblems of this pool with our sequential B\&B;
 \item get the sequential resolution time $T{cpu}$ and the number of explored subproblems $N{cpu}$;
 \item check that $T{cpu}$ is approximately equal to $T$;
 \item initialize the pool of our GPU B\&B with the subproblems of the list $L$;