/* $Id$
 *
 * Name:    CouenneBab.hpp
 * Author:  Pietro Belotti
 * Purpose: B&B object  
 * Created: 2012-01-25
 *
 * This file is licensed under the Eclipse Public License (EPL)
 */

#ifndef COUENNEBAB_H
#define COUENNEBAB_H

#include "BonCbc.hpp"
#include "BonBabSetupBase.hpp"
#include "CouenneConfig.h"

namespace Couenne {

  class CouenneProblem;

  class COUENNELIB_EXPORT CouenneBab: public Bonmin::Bab {

  public:

    CouenneBab (); ///< Constructor

    virtual ~CouenneBab(); ///< Destructor

    void setProblem (CouenneProblem *p);

    virtual void branchAndBound (Bonmin::BabSetupBase &s); ///< Carry out branch and bound

    /// Get the best solution known to the problem (is optimal if
    /// MipStatus is FeasibleOptimal).  If no solution is known
    /// returns NULL.
    const double * bestSolution() const;

    /// Return objective value of the bestSolution
    double bestObj() const;

    /** return the best known lower bound on the objective value*/
    double bestBound() { return CoinMin(Bonmin::Bab::bestBound(), bestObj()); }

  protected:

    CouenneProblem *problem_;

  };
}

#endif