[BCP] BCP mps file

[Ted Ralphs]

BCP is not really meant to be used as a generic MILP solver---it is
intended as a framework for implementing custom algorithms that
utilize a combination of cut and column generation for solving
structured classes of MILPs. For parallel MILP, there are quite a few
options now in COIN. If you are looking for a solver to run
multi-threaded on a single multi-core machine, then there the options
are Cbc and SYMPHONY. Cbc is a better solver for generic MILPs.
SYMPHONY offers some specialized functionality, such as the ability to
warm-start and to solve bicriteria problems, that Cbc does not have.
For distributed-memory systems, there is SYMPHONY (again) and also
BLIS, which is part of the CHiPPS project. SYMPHONY works only with
PVM and has not been tested in its distributed memory configuration in
some time. BLIS is not as powerful as Cbc for solving generic MILPs,
but uses MPI for distributed memory execution and so should run out of
the box on most system (it has recently been testd with MPICH, but may
work with other flavors of MPI). Hope this helps!

Cheers,

Ted

On Tue, Jun 28, 2011 at 5:05 AM,  <geogrid at gmail.com> wrote:
> Hi,
>
> I am new to BCP and wonder if it can use mps file to solve a big mixed
> integer programs, (up to 115k variables). By default, it can deal with
> lp file, right?
> Could you guys recommend a good open source parallel MIP tool?
>
> Thanks!
>
> Tong
>
> _______________________________________________
> BCP mailing list
> BCP at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/bcp
>



-- 
Dr. Ted Ralphs
Associate Professor, Lehigh University
(610) 628-1280
ted 'at' lehigh 'dot' edu
coral.ie.lehigh.edu/~ted