[Coin-announce] new COIN-OR project: the MINLP solver LaGO

[Stefan Vigerske]

Dear users and developers of COIN-OR software,

we have the pleasure to announce that the MINLP solver LaGO (Lagrangian 
Global Optimizer) is now freely available as COIN-OR project 
(https://projects.coin-or.org/LaGO) under the Common Public Licence.

LaGO is designed to solve block-separable MINLPs by branch-and-cut.
The Branch and Cut algorithm is illustrated in the recent paper "LaGO - 
a (heuristic) Branch and Cut algorithm for nonconvex MINLPs" 
(http://www.mathematik.hu-berlin.de/publ/pre/2006/P-06-24.ps).
Other algorithms for the solution of MINLPs, which are also partly 
implemented in LaGO, are described in the book "Relaxation and 
Decomposition Methods for Mixed Integer Nonlinear Programming" 
(http://www.springer.com/sgw/cda/frontpage/0,11855,1-40290-22-50809088-0,00.html?changeHeader=true).
LaGO reads MINLPs in AMPL format. An interface to models in GAMS 
language will be added very soon.

In order to further improve LaGO, a COIN-OR project was started. You are 
welcome to
- use LaGO in an OR application
- report and maybe fix bugs
- add new features and improve the performance
...

For further information on how to obtain and use the LaGO code, please 
refer to the new LaGO webpage at COIN-OR: https://projects.coin-or.org/LaGO

With best regards,
Ivo Nowak and Stefan Vigerske