mirror of https://github.com/CGAL/cgal
removed QP solver
This commit is contained in:
parent
a262342bca
commit
09ccfb0918
|
|
@ -19,7 +19,7 @@ This package provides algorithms for computing inscribed areas of (convex hulls
|
|||
|
||||
\begin{ccPkgDescription}{Center Points \label{Pkg:CenterPoints}}
|
||||
\ccPkgSummary{
|
||||
This package provides algorithms for optimally covering a 2-dimensional point set with k=2,3,4 axis-aligned boxes.}
|
||||
This package provides algorithms for optimally covering a 2-dimensional point set with $k=2,3,4$ axis-aligned boxes.}
|
||||
|
||||
%\ccPkgDependsOn{}
|
||||
\ccPkgIntroducedInCGAL{2.4}
|
||||
|
|
@ -45,9 +45,9 @@ This package provides an algorithm for computing the smallest sphere containing
|
|||
\ccPkgLicense{\ccLicenseQPL}
|
||||
\end{ccPkgDescription}
|
||||
|
||||
\begin{ccPkgDescription}{Advanced Techniques \label{Pkg:OptAdvancedTechniques}}
|
||||
\begin{ccPkgDescription}{Matrix Search \label{Pkg:OptAdvancedTechniques}}
|
||||
\ccPkgSummary{
|
||||
This package provides abstract optimisation frameworks that can be used to model many concrete problems. One framework is monotone matrix search, the other one (to be documented in future releases) is convex quadratic programming (including linear programming). }
|
||||
This package provides an abstract optimisation frameworks that can be used to model many concrete problems.}
|
||||
|
||||
%\ccPkgDependsOn{}
|
||||
\ccPkgIntroducedInCGAL{2.4}
|
||||
|
|
|
|||
Loading…
Reference in New Issue