blob: 11da60a94c7189a2e2865326b6e9faa529afc814 (
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
// Copyright (C) 2007, International Business Machines Corporation and others.
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// Authors :
// Joao P. Goncalves, International Business Machines Corporation
//
// Date : November 12, 2007
#ifndef BonHeuristicDiveMIP_HPP
#define BonHeuristicDiveMIP_HPP
#include "BonOsiTMINLPInterface.hpp"
#include "BonBonminSetup.hpp"
#include "CbcHeuristic.hpp"
#include "CbcStrategy.hpp"
namespace Bonmin
{
class SubMipSolver;
class HeuristicDiveMIP : public CbcHeuristic
{
public:
#if 0
/// Default constructor
HeuristicDiveMIP();
#endif
/// Constructor with setup
HeuristicDiveMIP(BonminSetup * setup);
/// Copy constructor
HeuristicDiveMIP(const HeuristicDiveMIP ©);
/// Destructor
~HeuristicDiveMIP();
/// Assignment operator
HeuristicDiveMIP & operator=(const HeuristicDiveMIP & rhs);
/// Clone
virtual CbcHeuristic * clone() const = 0;
/// Initialize method
void Initialize(BonminSetup * setup);
/// Resets stuff if model changes
virtual void resetModel(CbcModel * model){
setModel(model);
}
/** Change setup used for heuristic.*/
virtual void setSetup(BonminSetup * setup){
setup_ = setup;
// Initialize(setup_->options());
}
/// Performs heuristic
virtual int solution(double &solutionValue, double *betterSolution);
/// sets internal variables
virtual void setInternalVariables(TMINLP2TNLP* minlp) = 0;
/// Selects the next variable to branch on
/** If bestColumn = -1, it means that no variable was found
*/
virtual void selectVariableToBranch(TMINLP2TNLP* minlp,
const vector<int> & integerColumns,
const double* newSolution,
int& bestColumn,
int& bestRound) = 0;
protected:
/** Setup to use for local searches (will make copies).*/
BonminSetup * setup_;
private:
/// How often to do (code can change)
int howOften_;
/// A subsolver for MIP
SubMipSolver * mip_;
};
}
#endif
|
