[Cbc] k-optimal solutions in CBC

[Matthew Galati]

Does CBC have a feasibility and cut callback mechanism? Like what you might
see in some other MILP solvers?

I am trying to generate the K-optimal solutions to a binary ILP using CBC.
My current approach, of solving MILPs and adding an exclusion cut for the
previous solution is fairly slow when K is big.

I think it can be done a bit smarter through callbacks as described here:
http://orinanobworld.blogspot.com/2012/04/k-best-solutions.html

Has anyone tried this kind of thing with CBC before?

Thanks,
Matt
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/cbc/attachments/20150706/3440c185/attachment.html>