From a0d9443af147e949c1e6a01ac24749d12593ec5b Mon Sep 17 00:00:00 2001 From: Harpreet Date: Sat, 3 Sep 2016 00:36:51 +0530 Subject: cbcintlinprog added --- .../linux/include/coin/CbcCompareEstimate.hpp | 48 ++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 thirdparty/linux/include/coin/CbcCompareEstimate.hpp (limited to 'thirdparty/linux/include/coin/CbcCompareEstimate.hpp') diff --git a/thirdparty/linux/include/coin/CbcCompareEstimate.hpp b/thirdparty/linux/include/coin/CbcCompareEstimate.hpp new file mode 100644 index 0000000..8f6c056 --- /dev/null +++ b/thirdparty/linux/include/coin/CbcCompareEstimate.hpp @@ -0,0 +1,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 + -- cgit