[Coin-lpsolver] CBC Heuristic, how to implement?

[Ulrich Spoerlein]

Hello all,

first of all, I have to apologize, as I dont know much about solving
MIPs, but I just need the optimal integer solution to one problem, so I
can compare it to my "integer heuristic".

Now the question is, can I use the solution of my heuristic to
kick-start the B&B algorithm? I know that an initial starting point for
the Simplex algorithm needs to obey certain rules, what's the deal with
B&B?

I took a look at CbcRounding, but am not able to figure out exactly how
to use this. Could you please describe in a few sentences which
functions to implement and which fields to set to the initial solution?

Ulrich Spoerlein
-- 
 PGP Key ID: F0DB9F44				Encrypted mail welcome!
Fingerprint: F1CE D062 0CA9 ADE3 349B  2FE8 980A C6B5 F0DB 9F44
Which is worse: ignorance or apathy?
Don't know. Don't care.