MaxFreqBrancher.h

Go to the documentation of this file.

// 
//     Minotaur -- It's only 1/2 bull
// 
//     (C)opyright 2009 - 2025 The Minotaur Team.
// 
 
#ifndef MINOTAURMAXFREQBRANCHER_H
#define MINOTAURMAXFREQBRANCHER_H
 
#include "Brancher.h"
 
namespace Minotaur {
 
  class Timer;
 
  struct MaxFreqBrStats {
    UInt calls;      
    double time;     
  };
 
  class MaxFreqBrancher : public Brancher {
    
    public:
      MaxFreqBrancher(EnvPtr env, HandlerVector & handlers);
 
      ~MaxFreqBrancher();
 
      // Find a branching candidate. Returns NULL if x does not have any
      // thing to branch on or if no branching candidates are needed. 
      Branches findBranches(RelaxationPtr rel, NodePtr node, 
                            ConstSolutionPtr sol, SolutionPoolPtr s_pool, 
                            BrancherStatus & br_status, ModVector &mods);
 
      // Update pseudo-cost/other information after branching.
      virtual void updateAfterSolve(NodePtr, ConstSolutionPtr);
 
      // write statistics.
      void writeStats(std::ostream &out) const;
 
      // Return name.
      std::string getName() const;
 
      void initialize(RelaxationPtr rel);
 
    private:
      const static std::string me_; 
 
      double zTol_;
 
      BrancherStatus status_;
 
      RelaxationPtr rel_;
 
      DoubleVector x_;
 
      HandlerVector handlers_;
 
      Timer *timer_;
 
      MaxFreqBrStats * stats_;
 
      BrVarCandSet cands_; 
 
      bool init_;
 
      UIntVector fracCount_;
 
      UIntVector unfixedCount_;
 
      void updateFracCount_();
 
      void updateUnfixedCount_();
 
      void findCandidates_();
 
      BrCandPtr findBestCandidate_();
 
  };
  typedef MaxFreqBrancher* MaxFreqBrancherPtr;
}
#endif