blob: 4f0dcb066601257b2fb5ed03ca822dce7a76103c (
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
|
/* $Id: CbcHeuristicDivePseudoCost.hpp 1899 2013-04-09 18:12:08Z stefan $ */
// Copyright (C) 2008, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
#ifndef CbcHeuristicDivePseudoCost_H
#define CbcHeuristicDivePseudoCost_H
#include "CbcHeuristicDive.hpp"
/** DivePseudoCost class
*/
class CbcHeuristicDivePseudoCost : public CbcHeuristicDive {
public:
// Default Constructor
CbcHeuristicDivePseudoCost ();
// Constructor with model - assumed before cuts
CbcHeuristicDivePseudoCost (CbcModel & model);
// Copy constructor
CbcHeuristicDivePseudoCost ( const CbcHeuristicDivePseudoCost &);
// Destructor
~CbcHeuristicDivePseudoCost ();
/// Clone
virtual CbcHeuristicDivePseudoCost * clone() const;
/// Assignment operator
CbcHeuristicDivePseudoCost & operator=(const CbcHeuristicDivePseudoCost& rhs);
/// Create C++ lines to get to current state
virtual void generateCpp( FILE * fp) ;
/// Selects the next variable to branch on
/** Returns true if all the fractional variables can be trivially
rounded. Returns false, if there is at least one fractional variable
that is not trivially roundable. In this case, the bestColumn
returned will not be trivially roundable.
*/
virtual bool selectVariableToBranch(OsiSolverInterface* solver,
const double* newSolution,
int& bestColumn,
int& bestRound);
/** Initializes any data which is going to be used repeatedly
in selectVariableToBranch */
virtual void initializeData() ;
/// Fix other variables at bounds
virtual int fixOtherVariables(OsiSolverInterface * solver,
const double * solution,
PseudoReducedCost * candidate,
const double * random);
};
#endif
|
