On Tue, 18 Nov 2008 17:13:10 +0300, Andrew Makhorin wrote:
<skiped>
> The benchmarks above are still hard for glpk :(
> Note also that by default the glpk mip solver does not use cutting
> planes that may be inappropriate in many cases. The situation is the
> same as for p0548. Old versions of the glpk mip solver based on the
> branch-and-bound could not find even an integer feasible solution
> for an hour while glpk 4.34 using the pseudo-cost branching and mir
> cuts solves it to optimality for 3 seconds.
May be it's worth now to put an additional column in bench2.txt
with label like 'used/optimal option set'?
Best regards
- --
Vasily Zatsepin | mailto: [EMAIL PROTECTED]
Arachne WWW browser v.1.90J2-387
Visit http://arachne.browser.org/ - Web browser for DOS
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
