SepaHeuristicInnerApproximation.hpp

Go to the documentation of this file.

// (C) Copyright CNRS and others 2010
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// Authors :
// Pierre Bonami, Université de la Méditérannée
// Hassan Hijazi, Orange Labs
//
// Date : 05/22/2010

#ifndef BonHeuristicInnerApproximation_HPP
#define BonHeuristicInnerApproximation_HPP
#include "BonOsiTMINLPInterface.hpp"
#include "BonBonminSetup.hpp"
#include "CbcHeuristic.hpp"
#include "CbcStrategy.hpp"

namespace Bonmin {
class SubMipSolver;
}

namespace Sepa{
class HeuristicInnerApproximation: public CbcHeuristic {
public:

        HeuristicInnerApproximation(Bonmin::BonminSetup * setup);

        HeuristicInnerApproximation(const HeuristicInnerApproximation &copy);

        ~HeuristicInnerApproximation();

        HeuristicInnerApproximation & operator=(
                        const HeuristicInnerApproximation & rhs);

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

        void Initialize(Bonmin::BonminSetup * setup);

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

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

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

protected:
        Bonmin::BonminSetup * setup_;

private:
        int howOften_;

        Bonmin::SubMipSolver * mip_;

        int nbAp_;

        double time_limit_;

        void extractInnerApproximation(Bonmin::OsiTMINLPInterface & nlp, OsiSolverInterface &si,
                                       const double * x, bool getObj);

        bool getMyInnerApproximation(Bonmin::OsiTMINLPInterface &si, OsiCuts &cs, int ind,
                const double * x, const double * x2);


};
}

#endif