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

diff --git a/BookGPU/Chapters/chapter8/ch8.tex b/BookGPU/Chapters/chapter8/ch8.tex
index 9352b56..101a552 100644
--- a/BookGPU/Chapters/chapter8/ch8.tex
+++ b/BookGPU/Chapters/chapter8/ch8.tex
@@ -3,7 +3,7 @@
 \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}
-
+\label{ch8:GPU-accelerated-tree-based-exact-optimization-methods}
 \section{Introduction}
 \label{ch8:introduction}
 
@@ -858,4 +858,4 @@ Experiments show also that the proposed refactoring approach improves the parall
 
 In the near future, we plan to extend this work to a cluster of GPU-accelerated multi-core processors. From the application point of view, the objective is to optimally solve challenging and unsolved Flow-Shop instances as we did it for one 50$\times$20 problem instance with grid computing \cite{ch8:Mezmaz_2007}. Finally, we plan to investigate other lower bound functions to deal with other combinatorial optimization problems. 
 
-\putbib[Chapters/chapter8/biblio8] 
\ No newline at end of file
+\putbib[Chapters/chapter8/biblio8]