[Coin-contest] State of Sbb

[John J Forrest]

I think I have now got Sbb in a good enough state for people to start
looking at it.  I have put into cvs:

a) My current competition driver i.e. the one people have to beat.  There
will be improvements e.g. hopefully the cut generators will be better
deployed and there will be a first attempt at an integer presolve, but it
gives a reasonable idea as to the sort of code it will be.  The driver is
sample2.cpp in Sbb/Samples together with various files starting Sbb which
are examples of how to modify search strategy and add a new heuristic.
Adding cut generators is just a matter of keeping to Cgl cut generator
methods.

b) I have put a directory miplib3 in Samples which has miplib.cat and 59
problems.

c) There is a trivial script "runtimes" in Samples which runs some or all
of set.  A time limit in minutes may be passed in.  At present 44 out of
the 59 are uncommented so they will run.  These 44 run in less than 30
minutes with a total of just over 2 hours (1.7 ghz Pentium 4).  A few more
can be run by giving a longer time and/or tweaking parameters e.g. mod011,
qiu.

The version of Sbb (and associated Clp, Coin, Osi and Cgl) has been tagged
in cvs with the tag sbb-0-60-0 to indicate Sbb version 0.60.0.

Please comment where you think code needs extra explanations.

John Forrest