- Main Page
- Modules
- Namespaces
- Classes
- Files
- Related Pages

- File List
- File Members

# /home/coin/SVN-release/Blis-0.92.0/Bcps/examples/Blis/BlisBranchStrategyPseudo.h

Go to the documentation of this file.

    00001 /*===========================================================================*
    00002  * This file is part of the Bcps Linear Solver (BLIS).                       *
    00003  *                                                                           *
    00004  * ALPS is distributed under the Eclipse Public License as part of the       *
    00005  * COIN-OR repository (http://www.coin-or.org).                              *
    00006  *                                                                           *
    00007  * Authors:                                                                  *
    00008  *                                                                           *
    00009  *          Yan Xu, Lehigh University                                        *
    00010  *          Ted Ralphs, Lehigh University                                    *
    00011  *                                                                           *
    00012  * Conceptual Design:                                                        *
    00013  *                                                                           *
    00014  *          Yan Xu, Lehigh University                                        *
    00015  *          Ted Ralphs, Lehigh University                                    *
    00016  *          Laszlo Ladanyi, IBM T.J. Watson Research Center                  *
    00017  *          Matthew Saltzman, Clemson University                             *
    00018  *                                                                           *
    00019  *                                                                           *
    00020  * Copyright (C) 2001-2011, Lehigh University, Yan Xu, and Ted Ralphs.       *
    00021  * All Rights Reserved.                                                      *
    00022  *===========================================================================*/
    00023
    00024
    00025 //#############################################################################
    00026 // NOTE: Borrow ideas from COIN/Cbc
    00027 //#############################################################################
    00028
    00029
    00030 #ifndef BlisBranchStrategyPseudo_h_
    00031 #define BlisBranchStrategyPseudo_h_
    00032
    00033 #include "BcpsBranchObject.h"
    00034 #include "BcpsBranchStrategy.h"
    00035 #include "BlisModel.h"
    00036
    00037
    00041 class BlisBranchStrategyPseudo : public BcpsBranchStrategy {
    00042
    00043  private:
    00045     BlisBranchStrategyPseudo& operator=(const BlisBranchStrategyPseudo& rhs);
    00046
    00047     int relibility_;
    00048
    00049  public:
    00050
    00052     BlisBranchStrategyPseudo() : relibility_(1) {}
    00053
    00055     BlisBranchStrategyPseudo(BlisModel *model, int rel)
    00056         :
    00057         BcpsBranchStrategy(model),
    00058         relibility_(rel)
    00059         {}
    00060
    00062     virtual ~BlisBranchStrategyPseudo() {}
    00063
    00065     BlisBranchStrategyPseudo(const BlisBranchStrategyPseudo &);
    00066
    00068     void setRelibility(int rel) { relibility_ = rel; }
    00069
    00071     virtual BcpsBranchStrategy * clone() const {
    00072         return new BlisBranchStrategyPseudo(*this);
    00073     }
    00074
    00080     virtual int betterBranchObject(BcpsBranchObject * thisOne,
    00081                                    BcpsBranchObject * bestSoFar);
    00082
    00084     int createCandBranchObjects(int numPassesLeft, double ub);
    00085 };
    00086
    00087 #endif