blob: a5efbc6c376c95560c1a59ed680cb91bcd85df39 (
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
|
// 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 BonHeuristicDiveFractional_H
#define BonHeuristicDiveFractional_H
#include "BonBonminSetup.hpp"
#include "BonHeuristicDive.hpp"
/** DiveFractional class
*/
namespace Bonmin
{
class HeuristicDiveFractional : public HeuristicDive {
public:
/// Default Constructor
HeuristicDiveFractional ();
/// Constructor with setup
HeuristicDiveFractional(BonminSetup * setup);
/// Copy constructor
HeuristicDiveFractional(const HeuristicDiveFractional ©);
/// Destructor
~HeuristicDiveFractional() {}
/// Assignment operator
HeuristicDiveFractional & operator=(const HeuristicDiveFractional & rhs);
/// Clone
virtual CbcHeuristic * clone() const;
/** Change setup used for heuristic.*/
virtual void setSetup(BonminSetup * setup){
HeuristicDive::setSetup(setup);
Initialize(setup->options());
}
/// sets internal variables
virtual void setInternalVariables(TMINLP2TNLP* minlp);
/// 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);
/** 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);
};
}
#endif
|
