diff --git a/Optimisation_doc/doc_tex/Bounded_volumes/PkgDescription.tex b/Optimisation_doc/doc_tex/Bounded_volumes/PkgDescription.tex
index 02c8e248bf3..6285730333c 100644
--- a/Optimisation_doc/doc_tex/Bounded_volumes/PkgDescription.tex
+++ b/Optimisation_doc/doc_tex/Bounded_volumes/PkgDescription.tex
@@ -1,9 +1,9 @@
 
-\begin{ccPkgDescription}{BoundingVolumes \label{Pkg:BoundingVolumes}}
-\ccPkgHowToCiteCgal{cgal:fghhs-go-07}
+\begin{ccPkgDescription}{Bounding Volumes \label{Pkg:BoundingVolumes}}
+\ccPkgHowToCiteCgal{cgal:fghhs-bv-07}
 \ccPkgSummary{
 This package provides algorithms for computing bounding volumes
-The algorithms for bounding volumes for point sets in
+The algorithms for point sets in
  d-dimensional space are: the smallest enclosing sphere, annulus,
  ellipsoid, or strip. For 2-dimensional space, a number of additional
  volumes (rectangles, parallelograms, $k=2,3,4$ axis-aligned rectangles) 
@@ -14,5 +14,5 @@ on a set of d-dimensional spheres.}
 %\ccPkgDependsOn{}
 \ccPkgIntroducedInCGAL{1.1}
 \ccPkgLicense{\ccLicenseQPL}
-\ccPkgIllustration{Optimisation//minCircle.png}{Optimisation//minCircle.png}
+\ccPkgIllustration{Bounded_volumes/minCircle.png}{Bounded_volumes/minCircle.png}
 \end{ccPkgDescription}