blob: c83852f5a07ce309c31436a30686336640dd170a (
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
|
/* $Id: CbcHeuristicDiveVectorLength.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 CbcHeuristicDiveVectorLength_H
#define CbcHeuristicDiveVectorLength_H
#include "CbcHeuristicDive.hpp"
/** DiveVectorLength class
*/
class CbcHeuristicDiveVectorLength : public CbcHeuristicDive {
public:
// Default Constructor
CbcHeuristicDiveVectorLength ();
// Constructor with model - assumed before cuts
CbcHeuristicDiveVectorLength (CbcModel & model);
// Copy constructor
CbcHeuristicDiveVectorLength ( const CbcHeuristicDiveVectorLength &);
// Destructor
~CbcHeuristicDiveVectorLength ();
/// Clone
virtual CbcHeuristicDiveVectorLength * clone() const;
/// Assignment operator
CbcHeuristicDiveVectorLength & operator=(const CbcHeuristicDiveVectorLength& 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);
};
#endif
|
