Module: ppl/ppl Branch: master Commit: d276a484e1cb5cf8eb4eb4bf5952038c61570f9a URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d276a484e1cb5...
Author: Enea Zaffanella zaffanella@cs.unipr.it Date: Wed Jul 15 14:04:49 2009 +0200
Adjusted weight thresholds.
---
tests/Polyhedron/weightwatch1.cc | 6 +++--- 1 files changed, 3 insertions(+), 3 deletions(-)
diff --git a/tests/Polyhedron/weightwatch1.cc b/tests/Polyhedron/weightwatch1.cc index 292e428..571725a 100644 --- a/tests/Polyhedron/weightwatch1.cc +++ b/tests/Polyhedron/weightwatch1.cc @@ -104,7 +104,7 @@ bool test01() { print_constraints(ph, "*** ph ***");
try { - Weightwatch ww(400, too_fat); + Weightwatch ww(2500000, too_fat); // Thanks to the blind relaxation of the strict inequality constraint, // polyhedron ph is easily seen to contain an integer point. const bool contains = ph.contains_integer_point(); @@ -170,7 +170,7 @@ bool test02() { print_constraints(ph, "*** ph ***");
try { - Weightwatch ww(400, too_fat); + Weightwatch ww(2500000, too_fat); // The branch-and-bound heuristics of the MIP solver behaves badly // on this particular example, causing timeout to expire. const bool contains = ph.contains_integer_point(); @@ -207,7 +207,7 @@ bool test03() { print_constraints(ph, "*** ph ***");
try { - Weightwatch ww(400, too_fat); + Weightwatch ww(1000000000, too_fat); // Polyhedron ph is the projection of the polyehdron of test01 // onto a lower dimensional space: the performance issue of previous // test does not depend on high dimension vector space.