blob: 8f6c056b10800b83d86f85a30dc4add4efc9a1a7 (
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
|
// $Id: CbcCompareEstimate.hpp 1899 2013-04-09 18:12:08Z stefan $
// Copyright (C) 2002, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
//Edwin 11/25/09 carved out of CbcCompareActual
#ifndef CbcCompareEstimate_H
#define CbcCompareEstimate_H
//#############################################################################
/* These are alternative strategies for node traversal.
They can take data etc for fine tuning
At present the node list is stored as a heap and the "test"
comparison function returns true if node y is better than node x.
*/
#include "CbcNode.hpp"
#include "CbcCompareBase.hpp"
#include "CbcCompare.hpp"
class CbcModel;
/* This is when rounding is being done
*/
class CbcCompareEstimate : public CbcCompareBase {
public:
// Default Constructor
CbcCompareEstimate () ;
~CbcCompareEstimate() ;
// Copy constructor
CbcCompareEstimate ( const CbcCompareEstimate &rhs);
// Assignment operator
CbcCompareEstimate & operator=( const CbcCompareEstimate& rhs);
/// Clone
virtual CbcCompareBase * clone() const;
/// Create C++ lines to get to current state
virtual void generateCpp( FILE * fp);
virtual bool test (CbcNode * x, CbcNode * y) ;
};
#endif //CbcCompareEstimate_H
|
