Module: ppl/ppl Branch: master Commit: f949a0fced3173a45aaab7f12579a82a15aa8674 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f949a0fced317...

Author: Enea Zaffanella zaffanella@cs.unipr.it Date: Tue Sep 7 19:31:56 2010 +0200

Mention the use of sparse matrices in MIP and PIP solvers.

---

NEWS | 12 +++++++++++- 1 files changed, 11 insertions(+), 1 deletions(-)

diff --git a/NEWS b/NEWS index 67c19e2..4b1ec5d 100644 --- a/NEWS +++ b/NEWS @@ -4,9 +4,19 @@ Parma Polyhedra Library NEWS -- history of user-visible changes

-------------------------------------------------------------------------- -NEWS for version 0.11 (release date to be decided) +NEWS for version 0.12 (release date to be decided) --------------------------------------------------------------------------

+New and Changed Features +======================== + +o The implementations of the MIP and PIP solvers are based on a new + data structure leading to significant space and time savings when + the tableau matrix is sparse; the benchmarks of the ppl_lpsol demo + show an improvement on the average case, that grows when the toughest + tests in the benchmark suite are considered. + + Bugfixes ========