From 4b64cf486f5c999fd8167758cae27839f3b50848 Mon Sep 17 00:00:00 2001 From: Harpreet Date: Sat, 3 Sep 2016 00:34:27 +0530 Subject: Structure updated and intqpipopt files added --- .../include/coin/BonLocalSolverBasedHeuristic.hpp | 102 --------------------- 1 file changed, 102 deletions(-) delete mode 100644 build/Bonmin/include/coin/BonLocalSolverBasedHeuristic.hpp (limited to 'build/Bonmin/include/coin/BonLocalSolverBasedHeuristic.hpp') diff --git a/build/Bonmin/include/coin/BonLocalSolverBasedHeuristic.hpp b/build/Bonmin/include/coin/BonLocalSolverBasedHeuristic.hpp deleted file mode 100644 index 3f935e6..0000000 --- a/build/Bonmin/include/coin/BonLocalSolverBasedHeuristic.hpp +++ /dev/null @@ -1,102 +0,0 @@ -// (C) Copyright CNRS -// This code is published under the Eclipse Public License. -// -// Authors : -// Pierre Bonami, LIF Université de la Méditérannée-CNRS -// -// Date : 06/18/2008 - -#ifndef BonLocalSolverBasedHeuristic_H -#define BonLocalSolverBasedHeuristic_H -#include "BonBonminSetup.hpp" -#include "CbcHeuristic.hpp" - -namespace Bonmin { - class LocalSolverBasedHeuristic : public CbcHeuristic { - public: - /** Default constructor.*/ - LocalSolverBasedHeuristic(); - - /** Constructor with setup.*/ - LocalSolverBasedHeuristic(BonminSetup * setup); - - /** Copy constructor.*/ - LocalSolverBasedHeuristic(const LocalSolverBasedHeuristic & other); - - /** Destructor.*/ - ~LocalSolverBasedHeuristic(); - - /** Virtual copy constructor.*/ - virtual CbcHeuristic * clone() const = 0; - - /// Assignment operator - LocalSolverBasedHeuristic & operator=(const LocalSolverBasedHeuristic& rhs); - -#if 0 - /// update model (This is needed if cliques update matrix etc) - virtual void setModel(CbcModel * model){throw -1;} -#endif - /// Resets stuff if model changes - virtual void resetModel(CbcModel * model){ - setModel(model); - } - - /** Change setup used for heuristic.*/ - void setSetup(BonminSetup * setup){ - setup_ = setup; - Initialize(setup_->options()); - } - /** Performs heuristic */ - virtual int solution(double & objectiveValue, - double * newSolution)=0; - - /** Performs heuristic which adds cuts */ - virtual int solution(double & objectiveValue, - double * newSolution, - OsiCuts & cs) {return 0;} - - - /** Do a local search based on setup and passed solver.*/ - int doLocalSearch(OsiTMINLPInterface * solver, - double *solution, - double & solValue, - double cutoff, std::string prefix = "local_solver.") const; - - /** Register the options common to all local search based heuristics.*/ - static void registerOptions(Ipopt::SmartPtr roptions); - - /** Setup the defaults.*/ - virtual void setupDefaults(Ipopt::SmartPtr options); - - /** Initiaize using passed options.*/ - void Initialize(Ipopt::SmartPtr options); - protected: - /** Setup to use for local searches (will make copies).*/ - BonminSetup * setup_; - - static void changeIfNotSet(Ipopt::SmartPtr options, - std::string prefix, - const std::string &option, - const std::string &value); - - static void changeIfNotSet(Ipopt::SmartPtr options, - std::string prefix, - const std::string &option, - const double &value); - - static void changeIfNotSet(Ipopt::SmartPtr options, - std::string prefix, - const std::string &option, - const int &value); - private: - /** Time limit in local search.*/ - double time_limit_; - /** maximal number of nodes in local search.*/ - int max_number_nodes_; - /** Maximal number of solutions in local search.*/ - int max_number_solutions_; - }; -} /** ends namespace Bonmin.*/ - -#endif - -- cgit