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

Author: Roberto Bagnara bagnara@cs.unipr.it Date: Mon Feb 27 17:22:59 2012 +0100

Updated.

---

CREDITS | 11 ++++++----- TODO | 8 ++------ 2 files changed, 8 insertions(+), 11 deletions(-)

diff --git a/CREDITS b/CREDITS index 99aa556..fe664a0 100644 --- a/CREDITS +++ b/CREDITS @@ -29,6 +29,12 @@ Former Members of the Core Development Team: Current Contributors: ---------------------

+ Andrea Cimino (former student of the University of Parma) + wrote most of the mixed integer programming + solver, and also most of the Java and OCaml + interfaces. He keeps helping us, especially + with the web site. + Marco Poletti (student of the University of Bologna) implemented the sparse matrices that are used in the MIP and PIP solvers of the PPL; he also @@ -78,11 +84,6 @@ Past Contributors: one of the four students with which the PPL project started.

- Andrea Cimino (former student of the University of Parma) - wrote most of the mixed integer programming - solver, and also most of the Java and OCaml - interfaces. - Katy Dobson (former student of the University of Leeds) worked on the formalization and definition of algorithms for rational grids and products diff --git a/TODO b/TODO index 271fb42..75b2e0d 100644 --- a/TODO +++ b/TODO @@ -1,11 +1,10 @@

-Enhancements for PPL 0.12 or later versions +Enhancements for PPL 0.13 or later versions ===========================================

- Make all the *affine*image() methods uniform as far as the specification is concerned. - Add the domains of bounded integers and affine spaces. -- Finish the domain of intervals. - Intervals are best instantiated with checked numbers with particular policies: review all the interfaced boxes, augment the testsuite, and update the documentation. @@ -66,7 +65,7 @@ Enhancements for PPL 0.12 or later versions - Any_Pointset domain: check the interface for lacking or useless methods.

-Enhancements for PPL 0.13 or later versions +Enhancements for PPL 0.14 or later versions ===========================================

- Find a way to let the GMP and checked-int versions of the PPL coexist @@ -108,8 +107,5 @@ Efficiency Issues - There must be a more efficient way to implement bool Polyhedron::is_disjoint_from(const Polyhedron&). - There must be a more efficient way to compute convex differences. -- We are being rather careless about the creation of temporaries - as far as the classes Linear_Expression, Constraint and Generator - are concerned. - Provide a better implementation of computing squares in MIP_Problem's steepest-edge to avoid big numbers.