BonHeuristicFPump.hpp

Go to the documentation of this file.

// Copyright (C) 2007, International Business Machines Corporation and others. 
// All Rights Reserved.
// This code is published under the Common Public License.
//
// Authors :
// Joao P. Goncalves, International Business Machines Corporation
//
// Date : November 12, 2007

#ifndef BonHeuristicFPump_HPP
#define BonHeuristicFPump_HPP
#include "BonOsiTMINLPInterface.hpp"
#include "BonBonminSetup.hpp"
#include "CbcHeuristic.hpp"

namespace Bonmin
{
  class  HeuristicFPump : public CbcHeuristic
  {
  public:
    HeuristicFPump();

    HeuristicFPump(BonminSetup * setup);

    HeuristicFPump(const HeuristicFPump &copy);

    ~HeuristicFPump() {}

    HeuristicFPump & operator=(const HeuristicFPump & rhs);

    virtual CbcHeuristic * clone() const{
      return new HeuristicFPump(*this);
    }

    virtual void resetModel(CbcModel * model){
      setModel(model);
    }

    void setSetup(BonminSetup * setup){
      setup_ = setup;
      Initialize(setup_->options());
    }

    virtual int solution(double &solutionValue, double *betterSolution);

    virtual int solution(double &solutionValue, double *betterSolution, OsiCuts & cs)
    {
      return solution(solutionValue, betterSolution);
    }

    static void registerOptions(Ipopt::SmartPtr<Bonmin::RegisteredOptions> roptions);

    void Initialize(Ipopt::SmartPtr<Ipopt::OptionsList> options);

  private:
    BonminSetup * setup_; 

    int objective_norm_;

    int enableAdvanced_;
  };

  class RoundingFPump
  {
  public:
    RoundingFPump(TMINLP2TNLP* minlp);

    ~RoundingFPump();

    void round(const double integerTolerance, 
               const double primalTolerance,
               double* solution);

  private:
    void gutsOfConstructor();

    TMINLP2TNLP* minlp_;

    int numberRows_;

    int numberColumns_;

    std::vector<std::pair<int, int> >* col_and_jac_g_;

  };

}
#endif