BiCePS Version 0.92 README
==========================

Welcome to BiCePS. BiCePS is distributed under the Eclipse Public License and
is freely redistributable. All source code and documentation is Copyright
2001-2011 by Lehigh University, Yan Xu, and Ted Ralphs. This README may be
distributed freely.

WHAT IS BiCePS?
===============

BiCePS is one of the libraries that make up the CHiPPS (COIN High Performance
Parallel Search Framework) library hierarchy. It implements that data-handling
functions needed to support development of many types of relaxation-based
branch-and-bound algorithms, especially for solving mathematical programs. It
is intended to capture the implementation of methods common to all such
algorithms without assuming anything about the structure of the mathematical
program or the bounding method used. BLIS, which is another layer built on top
of BiCePS, is a concretization of Bcps for the case of mixed integer linear
programs. DIP is another implementation being developed using BLIS that
implements a decomposition-based bounding procedure.

PROJECT WEB PAGE
================

https://projects.coin-or.org/CHiPPS

DOCUMENTATION
=============

The html documentation of the classes in BiCePS (See INSTALL file) can be
created. A user's guide that is under preparation that can help with running
or customizing BiCePS.

INSTALLATION
============

Please see the INSTALL file for a guide to install Bcps.

SUPPORT
=======

1. Authors

Source Code:

Yan Xu (yax2@lehigh.edu)
Ted Ralphs (tkralphs@lehigh.edu), Project Manager

Original Conceptual Design:

Yan Xu (yax2@lehigh.edu)
Ted Ralphs (tkralphs@lehigh.edu), Project Manager
Laci Ladanyi (ladanyi@us.ibm.com)
Matt Saltzman (mjs@clemson.edu)

2. List Serve

BiCePS users should use the CHiPPS mailing list. To subscribe, go to 
http://list.coin-or.org/mailman/listinfo/chipps

3. Bug Reports

Bug reports should be reported on the CHiPPS development web site at

https://projects.coin-or.org/CHiPPS/newticket
