blob: e0c35eac31fe7ee572c475a4b516fd439aa4a0ff (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
// (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 BonFixAndSolveHeuristic_H
#define BonFixAndSolveHeuristic_H
#include "BonLocalSolverBasedHeuristic.hpp"
namespace Bonmin {
class FixAndSolveHeuristic:public LocalSolverBasedHeuristic {
public:
/** Default constructor*/
FixAndSolveHeuristic();
/** Constructor with setup.*/
FixAndSolveHeuristic(BonminSetup * setup);
/** Copy constructor.*/
FixAndSolveHeuristic(const FixAndSolveHeuristic &other);
/** Virtual constructor.*/
virtual CbcHeuristic * clone() const{
return new FixAndSolveHeuristic(*this);
}
/** Destructor*/
virtual ~FixAndSolveHeuristic();
/** Runs heuristic*/
int solution(double & objectiveValue,
double * newSolution);
/** Register the options common to all local search based heuristics.*/
static void registerOptions(Ipopt::SmartPtr<Bonmin::RegisteredOptions> roptions);
/** Initiaize using passed options.*/
void Initialize(Ipopt::SmartPtr<Ipopt::OptionsList> options);
};
}/* Ends Bonmin namepace.*/
#endif
|