[Coin-lpsolver] DIMACS workshop on COIN

[John J Forrest]

As you may know there is a DIMACS workshop on COIN-OR July 17-20 see
http://dimacs.rutgers.edu/Workshops/COIN/.

There are two tutorials, each of two and a half hours!, which some of you
may be attending.  I am just starting to think about what I am going to
talk about and would welcome any suggestions from participants.

Tutorial: CLP: COIN-OR Linear Program solver
Speaker: John Forrest, IBM Research
Abstract: The COIN LP Solver is a free, open-source, linear program solver,
with emphasis on Simplex based algorithms. This tutorial will present some
of the ideas behind Clp and will explain some of the options which can be
used to improve performance using the stand-alone solver.  The tutorial
will include walking through one or two examples written in C++
(suggestions for such examples may be submitted before the workshop).
There will be time for answers to questions on using Clp, future
developments and ways users can help. The source code to Clp and the
examples are available at www.coin-or.org.



Tutorial: CBC: COIN-OR Branch and Cut solver
Speaker: John Forrest, IBM Research
Abstract: The COIN LP Solver is a free, open-source, mixed-integer program
solver. This tutorial will present some of the ideas behind Cbc and will
explain some of the options which can be used to improve performance using
the stand-alone solver.  The tutorial will include walking through one or
two examples written in C++ (suggestions for such examples may be submitted
before the workshop).  There will also be some discussion of linking Cbc to
AMPL.  There will be time for answers to questions on using Cbc, future
developments and ways users can help. The source code to Cbc and the
examples are available at www.coin-or.org