[Coin-announce] Version 1 of Clp

[John J Forrest]

(Apologies for multiple postings)
In conjunction with the move of COIN-OR  to its new host,  we are pleased 
to announce Version 1.0  of  the COIN-OR LP (CLP) Solver.

CLP Version 1.0 contains:
   - a simplex code with dual and primal variants (the dual being the 
preferred method), 
   - a presolve capacity which exists in the Coin directory for use by 
other solvers as well, 
   - an extensible matrix format which allows for specialized formats, 
such as a network or all ones.
   - virtual message handlers and event handlers for sophisticated users, 
   - dual and primal ranging, 
    - an interior point solver, 
   - three solvers for optimizing a quadratic objective function over a 
linear constraint set: (i) an interior point solver, (ii) a simplex solver 
and a (iii) sequential LP solver, and 
   - extensible matrix formats  for more ambitious structures, e.g. a GUB 
matrix or a dynamic matrix. 

Version 1.0 includes changes which make CLP faster when being used by SBB 
(Simple Branch and Bound, or as some people have said Slow Branch and 
Bound).  This will be an on-going project.

Prodded and helped by Thorsten Koch I have just added the ability to 
import and export bases in MPS format so now we are up to 1.00.01! 

Thank you to the  users and contributors in the open-source community for 
their stress testing, bug reports, and suggestions. Your feedback is 
invaluable for improving CLP. 
 
John Forrest
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/coin-announce/attachments/20041018/114099b4/attachment.htm