[Coin-discuss] COIN-OR Users Group Meeting discussion item: OSI standard for MIP solver

[Igor Vasiliev]

COIN-OR Users Group Meeting discussion item: OSI standard for MIP solver
Currently there are many implementation of branch and cut or branch and cut
and price algorithms (Cplex, Express, SYMPHONY, COIN/BCP, COIN/SBB, ABACUS
etc.). Some of them support the OSI standard to solve lp relaxation of MIP
problem but it will be great to extend OSI for the generic branch and cut
and price algorithm or, at least, for the branch and cut algorithm. In any
node of the search tree, it should allow a user to add his cut/column
generation, heuristic etc.
I suggest to discuss this topic with COIN community on COIN-OR Users Group
Meeting: Sunday, May 16, 2004, 1-2 PM.

Igor Vasil'ev
University of Salerno
igor at diima.unisa.it