| commit | aa817a3eb970eaf50e2775686b3da900d1afe7d1 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Sat, 15 Sep 2007 15:54:43 +0000 (15 17:54 +0200) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Sat, 15 Sep 2007 16:02:32 +0000 (15 18:02 +0200) | ||
| tree | 40f37f3f70f027128541a6dc32493b430a7a5fbe | treesnapshot (tar.gz zip) |
| parent | f61d68bb59d2a44b8c7d41dfe2f9cb558f54c60f | commitdiff |
topcom: fix heuristic for selecting rows to use as non-negativity constraints
If one of the rows is already (the negative of) a unit vector,
we put it in the right position. We then check the row again,
since we may not have checked the row that was on that right
position. However, we also did this when this row had already
been checked, leading to the possibility that a pair of rows
would endlessly be swapped.
We now only reconsider the row at the current position if
the row that was moved there has not already been checked.
If one of the rows is already (the negative of) a unit vector,
we put it in the right position. We then check the row again,
since we may not have checked the row that was on that right
position. However, we also did this when this row had already
been checked, leading to the possibility that a pair of rows
would endlessly be swapped.
We now only reconsider the row at the current position if
the row that was moved there has not already been checked.
| topcom.c | diffblobblamehistory |